Maxima of the Q-index: graphs without long paths
From MaRDI portal
Publication:5501686
zbMATH Open1320.05078arXiv1308.4341MaRDI QIDQ5501686FDOQ5501686
Authors: Vladimir Nikiforov, Xiying Yuan
Publication date: 14 August 2015
Abstract: This paper gives tight upper bound on the largest eigenvalue q(G) of the signless Laplacian of graphs with no paths of given order. The main ingredient of our proof is a stability result of its own interest, about graphs with large minimum degree and with no long paths. This result extends previous work of Ali and Staton.
Full work available at URL: https://arxiv.org/abs/1308.4341
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Paths and cycles (05C38)
Cited In (13)
- The signless Laplacian spectral radius of \(2K_3\)-free graphs
- A Brualdi-Hoffman-Turán problem on cycles
- The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
- Maxima of the \(Q\)-index: forbidden a Fan
- The signless Laplacian spectral radius of graphs with forbidding linear forests
- Maximize the \(Q\)-index of graphs with fixed order and size
- The signless Laplacian spectral radius of graphs with no intersecting triangles
- Title not available (Why is that?)
- The signless Laplacian spectral radius of graphs without intersecting odd cycles
- Maxima of the \(Q\)-index: forbidden even cycles
- An \(A_{\alpha}\)-spectral Erdős-Sós theorem
- Merging the A-and Q-spectral theories
- Erdős-Gallai stability theorem for linear forests
This page was built for publication: Maxima of the \(Q\)-index: graphs without long paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501686)