A spectral condition for odd cycles in non-bipartite graphs

DOI10.1016/j.laa.2021.08.020zbMath1483.05095OpenAlexW3198620982MaRDI QIDQ2238862

Huiqiu Lin, Hangtian Guo

Publication date: 2 November 2021

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

Full work available at URL: https://doi.org/10.1016/j.laa.2021.08.020

zbMATH Keywords

spectral radiusgirthodd cyclenon-bipartite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Signless Laplacian spectral radius of graphs without short cycles or long cycles, Spectral radius, edge-disjoint cycles and cycles of the same length, Spectral extremal graphs for the bowtie, Refinement on Spectral Turán’s Theorem, Maxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cycles, Spectral radius of graphs of given size with forbidden subgraphs, On the sum of the k largest absolute values of Laplacian eigenvalues of digraphs, A spectral extremal problem on non-bipartite triangle-free graphs, Spectral radius of graphs with given size and odd girth, Spectral extremal problem on disjoint color-critical graphs, The maximum spectral radius of non-bipartite graphs forbidding short odd cycles

Cites Work

• Unnamed Item
• The spectral radius of graphs without paths and cycles of specified length
• Spectral bounds for the clique and independence numbers of graphs
• The spectral radius of graphs without long cycles
• Bounds on graph eigenvalues. II
• A spectral condition for odd cycles in graphs
• Pancyclic graphs. I
• Large cycles in graphs
• Eigenvalues and triangles in graphs
• Extensions of the Erdős–Gallai theorem and Luo’s theorem
• Extremal Numbers for Odd Cycles
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Sufficient Conditions for Circuits in Graphs^†
• On the theory of graphs