Indexed by:
Abstract:
Let λ(D) be the Aα spectral radius of digraph D, and let Gn r be the set of digraphs with order n and dichromatic number r. In this paper, we characterize the digraph which has the maximal Aα spectral radius in Gn r. Moreover, we also determine the unique digraph which attains the maximum (resp. minimum) Aα spectral radius among all strongly connected bicyclic digraphs. © 2018 Elsevier Inc.
Keyword:
Reprint 's Address:
Email:
Source :
Linear Algebra and Its Applications
ISSN: 0024-3795
Year: 2019
Volume: 563
Page: 63-74
0 . 9 8 8
JCR@2019
1 . 0 0 0
JCR@2023
ESI HC Threshold:59
JCR Journal Grade:2
CAS Journal Grade:3
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 16
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: