A proof of a conjecture on the distance spectral radius and maximum transmission of graphs
From MaRDI portal
Publication:2115168
DOI10.1007/S00373-021-02455-XzbMATH Open1484.05134arXiv2008.12935OpenAlexW3082076265WikidataQ113905208 ScholiaQ113905208MaRDI QIDQ2115168FDOQ2115168
Authors: Lele Liu, Hai-Ying Shan, Changxiang He
Publication date: 15 March 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Abstract: Let be a simple connected graph, and be the distance matrix of . Suppose that and are the maximum row sum and the spectral radius of , respectively. In this paper, we give a lower bound for , and characterize the extremal graphs attaining the bound. As a corollary, we solve a conjecture posed by Liu, Shu and Xue.
Full work available at URL: https://arxiv.org/abs/2008.12935
Recommendations
- On the distance and distance Laplacian eigenvalues of graphs
- On spectral radius of the generalized distance matrix of a graph
- Proof of a conjecture on the distance Laplacian spectral radius of graphs
- On distance spectral radius and distance energy of graphs
- On the largest distance (signless Laplacian) eigenvalue of non-transmission-regular graphs
Cites Work
Cited In (5)
- On the distance and distance Laplacian eigenvalues of graphs
- Distance spectral radius of some \(k\)-partitioned transmission regular graphs
- On the largest distance (signless Laplacian) eigenvalue of non-transmission-regular graphs
- Proof of a conjecture on the distance Laplacian spectral radius of graphs
- Graph functions maximized on a path
This page was built for publication: A proof of a conjecture on the distance spectral radius and maximum transmission of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115168)