Colorings and Aα spectral radius of (join) digraphs

Xiuwen Yang; Ligong Wang; Jing Li

doi:10.2298/FIL2511555Y

Colorings and A_α spectral radius of (join) digraphs

Xiuwen Yang, Ligong Wang, Jing Li

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

Abstract

Let G_n,r be the set of digraphs of order n with dichromatic number r. Let in-tree be a directed tree with n vertices which the outdegree of each vertex is at most one. In this paper, we obtain the digraph which has the minimal A_α spectral radius of the join of in-trees with dichromatic number r. Moreover, we characterize the digraph which has the maximal A_α spectral radius in G_n,r by using a new method.

Original language	English
Pages (from-to)	3555-3568
Number of pages	14
Journal	Filomat
Volume	39
Issue number	11
DOIs	https://doi.org/10.2298/FIL2511555Y
State	Published - 2025

Keywords

A spectral radius
dichromatic number
quotient matrix

Access to Document

10.2298/FIL2511555Y

Cite this

@article{37fc4982a04e4b9e8a8a144afbb82b6b,

title = "Colorings and Aα spectral radius of (join) digraphs",

abstract = "Let Gn,r be the set of digraphs of order n with dichromatic number r. Let in-tree be a directed tree with n vertices which the outdegree of each vertex is at most one. In this paper, we obtain the digraph which has the minimal Aα spectral radius of the join of in-trees with dichromatic number r. Moreover, we characterize the digraph which has the maximal Aα spectral radius in Gn,r by using a new method.",

keywords = "A spectral radius, dichromatic number, quotient matrix",

author = "Xiuwen Yang and Ligong Wang and Jing Li",

year = "2025",

doi = "10.2298/FIL2511555Y",

language = "英语",

volume = "39",

pages = "3555--3568",

journal = "Filomat",

issn = "0354-5180",

publisher = "Universitet of Nis",

number = "11",

}

TY - JOUR

T1 - Colorings and Aα spectral radius of (join) digraphs

AU - Yang, Xiuwen

AU - Wang, Ligong

AU - Li, Jing

PY - 2025

Y1 - 2025

N2 - Let Gn,r be the set of digraphs of order n with dichromatic number r. Let in-tree be a directed tree with n vertices which the outdegree of each vertex is at most one. In this paper, we obtain the digraph which has the minimal Aα spectral radius of the join of in-trees with dichromatic number r. Moreover, we characterize the digraph which has the maximal Aα spectral radius in Gn,r by using a new method.

AB - Let Gn,r be the set of digraphs of order n with dichromatic number r. Let in-tree be a directed tree with n vertices which the outdegree of each vertex is at most one. In this paper, we obtain the digraph which has the minimal Aα spectral radius of the join of in-trees with dichromatic number r. Moreover, we characterize the digraph which has the maximal Aα spectral radius in Gn,r by using a new method.

KW - A spectral radius

KW - dichromatic number

KW - quotient matrix

UR - http://www.scopus.com/inward/record.url?scp=105003316265&partnerID=8YFLogxK

U2 - 10.2298/FIL2511555Y

DO - 10.2298/FIL2511555Y

M3 - 文章

AN - SCOPUS:105003316265

SN - 0354-5180

VL - 39

SP - 3555

EP - 3568

JO - Filomat

JF - Filomat

IS - 11

ER -

Colorings and A_α spectral radius of (join) digraphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this