A proof of a conjecture on the distance spectral radius and maximum transmission of graphs

From MaRDI portal
Publication:2115168




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.









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)