On the α-spectral radius of graphs

From MaRDI portal
Publication:5028787




Abstract: For 0lealphale1, Nikiforov proposed to study the spectral properties of the family of matrices Aalpha(G)=alphaD(G)+(1alpha)A(G) of a graph G, where D(G) is the degree diagonal matrix and A(G) is the adjacency matrix. The alpha-spectral radius of G is the largest eigenvalue of Aalpha(G). We give upper bounds for alpha-spectral radius for unicyclic graphs G with maximum degree Deltage2, connected irregular graphs with given maximum degree and and some other graph parameters, and graphs with given domination number, respectively. We determine the unique tree with second maximum alpha-spectral radius among trees, and the unique tree with maximum alpha-spectral radius among trees with given diameter. For a graph with two pendant paths at a vertex or at two adjacent vertex, we prove results concerning the behavior of the alpha-spectral radius under relocation of a pendant edge in a pendant path. We also determine the unique graphs such that the difference between the maximum degree and the alpha-spectral radius is maximum among trees, unicyclic graphs and non-bipartite graphs, respectively.



Cites work


Cited in
(38)






This page was built for publication: On the α-spectral radius of graphs

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