The signless Laplacian spectral radius of graphs with forbidding linear forests
From MaRDI portal
Publication:2174499
Abstract: Tur'{a}n type extremal problem is how to maximize the number of edges over all graphs which do not contain fixed forbidden subgraphs. Similarly, spectral Tur'{a}n type extremal problem is how to maximize (signless Laplacian) spectral radius over all graphs which do not contain fixed subgraphs. In this paper, we first present a stability result for in terms of the number of edges and then determine all extremal graphs maximizing the signless Laplacian spectral radius over all graphs which do not contain a fixed linear forest with at most two odd paths or as a subgraph, respectively.
Recommendations
- Spectral extremal results with forbidding linear forests
- The maximum spectral radius of graphs without spanning linear forests
- Some new results and problems in spectral extremal graph theory
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- Signless Laplacian spectral radius of graphs without short cycles or long cycles
Cites work
- A contribution to the Zarankiewicz problem
- A note on Laplacian graph eigenvalues
- A proof for a conjecture of Gorgol
- Erdős-Gallai stability theorem for linear forests
- Graph theory
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Maxima of the Q-index, forbidden 4-ycle and 5-cycle
- Maxima of the \(Q\)-index: forbidden even cycles
- Maxima of the \(Q\)-index: forbidden odd cycles
- Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\)
- Maxima of the Q-index: graphs without long paths
- On maximal paths and circuits of graphs
- On the Turán number of forests
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
- Signless Laplacians of finite graphs
- Some new results in extremal graph theory
- Spectral extremal results with forbidding linear forests
- The Colin de Verdière parameter, excluded minors, and the spectral radius
- The spectral radius of graphs without paths and cycles of specified length
- The Turán number of disjoint copies of paths
- Three conjectures in extremal spectral graph theory
- Turán numbers of multiple paths and equibipartite forests
Cited in
(15)- Spectral extremal results with forbidding linear forests
- Maxima of the \(Q\)-index: forbidden a Fan
- The maximum spectral radius of graphs without spanning linear forests
- Some new results and problems in spectral extremal graph theory
- Maximum degree and spectral radius of graphs in terms of size
- On the \(A_\alpha\)-spectral radius of graphs without linear forests
- An \(A_{\alpha}\)-spectral Erdős-Sós theorem
- Spectral Tur\'{a}n problem for $\mathcal{K}_5^{-}$-free signed graphs
- The signless Laplacian spectral radius of 2K₃-free graphs
- The signless Laplacian spectral Turán problems for color-critical graphs
- A signless Laplacian spectral Erdős-Stone-Simonovits theorem
- Maxima of the Q-index: forbidden rainbow Hamilton paths, matchings and linear forests
- Some Turán-type results for the signless Laplacian spectral radius
- Maximal Q-index: graphs without long wheels
- The (signless) Laplacian spectral radius with a fixed induced subgraph of a graph
This page was built for publication: The signless Laplacian spectral radius of graphs with forbidding linear forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174499)