TY - JOUR
T1 - On the distance spectral radius of digraphs with given diameter
AU - Xi, Weige
AU - So, Wasin
AU - Wang, Ligong
N1 - Publisher Copyright:
© 2019 Informa UK Limited, trading as Taylor & Francis Group.
PY - 2021
Y1 - 2021
N2 - The distance spectral radius (Formula presented.) of a strongly connected digraph G is the eigenvalue of its distance matrix (Formula presented.) with the largest modulus. Let (Formula presented.) denote the set of strongly connected digraphs with order n and diameter d. In this paper, we completely determine the strongly connected digraphs minimizing (Formula presented.) among all strongly connected digraphs with order n and diameter d, for d = 1, 2, 3, 4, 5, 6, 7, n−1. We also propose a conjecture about the minimum distance spectral radius among all strongly connected digraphs with given diameter (Formula presented.).
AB - The distance spectral radius (Formula presented.) of a strongly connected digraph G is the eigenvalue of its distance matrix (Formula presented.) with the largest modulus. Let (Formula presented.) denote the set of strongly connected digraphs with order n and diameter d. In this paper, we completely determine the strongly connected digraphs minimizing (Formula presented.) among all strongly connected digraphs with order n and diameter d, for d = 1, 2, 3, 4, 5, 6, 7, n−1. We also propose a conjecture about the minimum distance spectral radius among all strongly connected digraphs with given diameter (Formula presented.).
KW - diameter
KW - distance spectral radius
KW - Strongly connected
UR - http://www.scopus.com/inward/record.url?scp=85074909072&partnerID=8YFLogxK
U2 - 10.1080/03081087.2019.1682496
DO - 10.1080/03081087.2019.1682496
M3 - 文章
AN - SCOPUS:85074909072
SN - 0308-1087
VL - 69
SP - 2547
EP - 2557
JO - Linear and Multilinear Algebra
JF - Linear and Multilinear Algebra
IS - 14
ER -