Open AccessAn asymptotically tight bound on the q-index of graphs with forbidden cycles
Author(s) -
Vladimir Nikiforov
Publication year - 2014
Publication title -
publications de l institut mathematique
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.246
H-Index - 17
eISSN - 1820-7405
pISSN - 0350-1302
DOI - 10.2298/pim1409189n
Subject(s) - combinatorics , conjecture , mathematics , graph , upper and lower bounds , eigenvalues and eigenvectors , laplace operator , order (exchange) , discrete mathematics , physics , mathematical analysis , quantum mechanics , finance , economics
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom