An asymptotically tight bound on the Q-index of graphs with forbidden cycles

2013/10/05 by Vladimir Nikiforov, Nikiforov, V.
Computer Science · Mathematics · #05C50 #15A42 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1310.1430

openalex publication_date 2013/10/05 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

Let G be a graph of order n and let q(G) be that largest eigenvalue of the signless Laplacian of G. In this note it is shown that if k>1 and q(G)>=n+2k-2, then G contains cycles of length l whenever 2

Citations

• Note on Hamilton Circuits

Related

• Maxima of the Q-index: forbidden even cycles
• Maxima Q-index of graphs with forbidden odd cycles
• Maxima of the Q-index: forbidden 4-cycle and 5-cycle
• Maxima of the Q-index: graphs with no K_s,t
• Maxima of the Q-index: graphs without long paths