On the distance spectral radius of digraphs with given diameter
Authors:
- 26 October 2019
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 69 (14) , 2547-2557
Abstract
The distance spectral radius of a strongly connected digraph G is the eigenvalue of its distance matrix with the largest modulus. Let denote the set of strongly connected digraphs with order n and diameter d. In this paper, we completely determine the strongly connected digraphs minimizing 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 .
Keywords
Funding Information
- National Natural Science Foundation of China (1871398)
- Natural Science Basic Research Plan in Shaanxi Province of China (Program No. 2018JM1032)
- China Scholarship Council (201706290182)
This publication has 16 references indexed in Scilit:
- The distance spectral radius of digraphsDiscrete Applied Mathematics, 2013
- On the distance spectral radius of some graphsLinear Algebra and its Applications, 2012
- Distance spectral radius of digraphs with given connectivityDiscrete Mathematics, 2012
- On the distance spectral radius of bipartite graphsLinear Algebra and its Applications, 2012
- Distance spectral radius of graphs with pendent verticesLinear Algebra and its Applications, 2011
- Connectivity and minimal distance spectral radius of graphsLinear and Multilinear Algebra, 2011
- Mass Transfer Coefficients and Correlation for CO2 Absorption into 2-Amino-2-methyl-1-propanol (AMP) Using Structured PackingIndustrial & Engineering Chemistry Research, 1998
- Topological indices and real number vertex invariants based on graph eigenvalues or eigenvectorsJournal of Chemical Information and Computer Sciences, 1991
- On embedding graphs in squashed cubes1972
- On the Addressing Problem for Loop SwitchingBell System Technical Journal, 1971