arXiv:1308.4341 [math.CO]AbstractReferencesReviewsResources
Maxima of the Q-index: graphs without long paths
Vladimir Nikiforov, Xiying Yuan
Published 2013-08-20Version 1
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.
Related articles: Most relevant | Search more
arXiv:1602.01033 [math.CO] (Published 2016-02-02)
Spectral radius and Hamiltonicity of graphs with large minimum degree
arXiv:1711.11257 [math.CO] (Published 2017-11-30)
Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
arXiv:1510.09166 [math.CO] (Published 2015-10-30)
Long paths and cycles in random subgraphs of graphs with large minimum degree