Maxima of the Q-index: graphs without long paths
Combinatorics
2013-08-21 v1
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.
Cite
@article{arxiv.1308.4341,
title = {Maxima of the Q-index: graphs without long paths},
author = {Vladimir Nikiforov and Xiying Yuan},
journal= {arXiv preprint arXiv:1308.4341},
year = {2013}
}
Comments
10 pages