A proof of a conjecture on the distance spectral radius and maximum transmission of graphs
From MaRDI portal
Publication:2115168
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.
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)- Distance spectral radius of some \(k\)-partitioned transmission regular graphs
- On the distance and distance Laplacian eigenvalues of graphs
- Proof of a conjecture on the distance Laplacian spectral radius of graphs
- Graph functions maximized on a path
- On the largest distance (signless Laplacian) eigenvalue of non-transmission-regular graphs
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)