A spectral condition for odd cycles in graphs

From MaRDI portal
Publication:2477528

DOI10.1016/J.LAA.2007.09.029zbMATH Open1152.05045arXiv0707.4499OpenAlexW1972118561MaRDI QIDQ2477528

Vladimir Nikiforov

Publication date: 14 March 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We give a sharp spectral condition for the existence of odd cycles in a graph of given order. We also prove a related stability result.


Full work available at URL: https://arxiv.org/abs/0707.4499





Cites Work


Related Items (46)

Spectral radius, edge-disjoint cycles and cycles of the same lengthNegative (and positive) circles in signed graphs: a problem collectionOn the principal eigenvectors of uniform hypergraphsThe maximum spectral radius of wheel-free graphsSpectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. TaitThe spectral Turán problem about graphs with no 6-cycleA sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given sizeOn a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all treesA strengthening of the spectral chromatic critical edge theorem: Books and theta graphsOn the \(A_\alpha \)-spectral radius of graphs with given sizeA Spectral Erdős-Sós TheoremEigenvalues and cycles of consecutive lengthsExtremal problems for the \(p\)-spectral radius of graphsThe spectral radius, maximum average degree and cycles of consecutive lengths of graphsSpectral extremal graphs for disjoint cliquesSpectral radius conditions for the existence of all subtrees of diameter at most fourThe index of signed graphs with forbidden subgraphsSpectral Turán problems for intersecting even cyclesSpectral extremal problem on disjoint color-critical graphsGeneralized Turán problems for even cyclesStability of Woodall's theorem and spectral conditions for large cyclesA spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphsProof of a conjecture on the spectral radius of \(C_4\)-free graphsUnnamed ItemSpectral extremal results with forbidding linear forestsThe spectral even cycle problemThe spectral radius of graphs with no odd wheelsA spectral condition for odd cycles in non-bipartite graphsAnalytic methods for uniform hypergraphsThe spectral radius of graphs without paths and cycles of specified lengthSpectral conditions for the existence of specified paths and cycles in graphsThe signless Laplacian spectral radius of graphs with no intersecting trianglesThe extremal \(\alpha \)-index of graphs with no 4-cycle and 5-cycleSpectral extremal results on treesSpectral extrema of graphs with fixed size: cycles and complete bipartite graphsSpectral extrema of graphs with fixed size: forbidden triangles and pentagonsOn the spectral radius of graphs without a gemOn the spectral Turán problem of theta graphsA spectral condition for the existence of a pentagon in non-bipartite graphsSpectral extremal problem on \(t\) copies of \(\ell\)-cyclesThe spectra of multiplicative attribute graphsA spectral condition for component factors in graphsExtensions of the Erdős–Gallai theorem and Luo’s theoremThe maximum spectral radius of \(C_4\)-free graphs of given order and sizeSpectral extrema of graphs: forbidden hexagonNew results on α-spectral radius of graphs






This page was built for publication: A spectral condition for odd cycles in graphs