On the distance spectral radius of digraphs with given diameter
Publication Date
1-1-2021
Document Type
Article
Publication Title
Linear and Multilinear Algebra
Volume
69
Issue
14
DOI
10.1080/03081087.2019.1682496
First Page
2547
Last Page
2557
Abstract
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.).
Funding Number
1871398
Funding Sponsor
National Natural Science Foundation of China
Keywords
diameter, distance spectral radius, Strongly connected
Department
Mathematics and Statistics
Recommended Citation
Weige Xi, Wasin So, and Ligong Wang. "On the distance spectral radius of digraphs with given diameter" Linear and Multilinear Algebra (2021): 2547-2557. https://doi.org/10.1080/03081087.2019.1682496
