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 Edit this on Wikidata


Publication date: 15 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: Let G be a simple connected graph, and D(G) be the distance matrix of G. Suppose that Dmax(G) and lambda1(G) are the maximum row sum and the spectral radius of D(G), respectively. In this paper, we give a lower bound for Dmax(G)lambda1(G), 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




Cites Work


Cited In (5)





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)