Maxima of the Q-index: graphs without long paths
classification
🧮 math.CO
keywords
graphspathslongresultbounddegreeeigenvalueextends
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.