On the distance -spectral radius of a connected graph

From MaRDI portal
Publication:2069474

DOI10.1186/S13660-020-02427-4zbMATH Open1503.05033arXiv1901.10180OpenAlexW3035066888MaRDI QIDQ2069474FDOQ2069474


Authors: Haiyan Guo, Bo Zhou Edit this on Wikidata


Publication date: 20 January 2022

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1901.10180




Recommendations




Cites Work


Cited In (17)





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)