On the A_-spectral radius of graphs without linear forests
From MaRDI portal
Publication:6160595
Abstract: Let and be the adjacency and degree matrices of a simple graph on vertices, respectively. The emph{-spectral radius} of is the largest eigenvalue of for a real number . In this paper, for , we obtain a sharp upper bound for the -spectral radius of graphs on vertices without a subgraph isomorphic to a liner forest for 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 vertices without a subgraph isomorphic to a liner forest for large enough.
Recommendations
Cites work
- \(a_\alpha \)-spectral radius of the second power of a graph
- Generalized Turán number for linear forests
- Generalized Turán number of even linear forests
- Graphs determined by their \(A_\alpha\)-spectra
- Merging the \(A\)- and \(Q\)-spectral theories
- On maximal paths and circuits of graphs
- On the Turán number of forests
- Some Nordhaus-Gaddum type results of \(A_\alpha \)-eigenvalues of weighted graphs
- Spectral extremal results on the -index of graphs without minors and star forests
- The extremal \(\alpha \)-index of graphs with no 4-cycle and 5-cycle
- The extremal \(\alpha \)-index of outerplanar and planar graphs
- The sharp upper bounds on the \(A_{\alpha}\)-spectral radius of \(C_4\)-free graphs and Halin graphs
- The signless Laplacian spectral radius of graphs with forbidding linear forests
- The Turán number of disjoint copies of paths
- Turán numbers of multiple paths and equibipartite forests
Cited in
(4)
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)