On the A_-spectral radius of graphs without linear forests

From MaRDI portal
Publication:6160595



Abstract: Let A(G) and D(G) be the adjacency and degree matrices of a simple graph G on n vertices, respectively. The emph{Aalpha-spectral radius} of G is the largest eigenvalue of Aalpha(G)=alphaD(G)+(1−alpha)A(G) for a real number alphain[0,1]. In this paper, for alphain(0,1), we obtain a sharp upper bound for the Aalpha-spectral radius of graphs on n vertices without a subgraph isomorphic to a liner forest for n large enough and characterize all graphs which attain the upper bound. As a result, we completely obtain the maximum signless Laplacian spectral radius of graphs on n vertices without a subgraph isomorphic to a liner forest for n large enough.












This page was built for publication: On the \(A_\alpha\)-spectral radius of graphs without linear forests

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