On the distance -spectral radius of a connected graph

From MaRDI portal
(Redirected from Publication:2069474)
On the distance \(\alpha \)-spectral radius of a connected graph




Abstract: For a connected graph G and alphain[0,1), the distance alpha-spectral radius of G is the spectral radius of the matrix Dalpha(G) defined as Dalpha(G)=alphaT(G)+(1alpha)D(G), where T(G) is a diagonal matrix of vertex transmissions of G and D(G) is the distance matrix of G. We give bounds for the distance alpha-spectral radius, especially for graphs that are not transmission regular, propose some graft transformations that decrease or increase the distance alpha-spectral radius, and determine the unique graphs with minimum and maximum distance alpha-spectral radius among some classes of graphs.



Cites work







This page was built for publication: On the distance \(\alpha \)-spectral radius of a connected graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2069474)