A spectral condition for odd cycles in non-bipartite graphs
From MaRDI portal
Publication:2238862
DOI10.1016/J.LAA.2021.08.020zbMATH Open1483.05095OpenAlexW3198620982MaRDI QIDQ2238862FDOQ2238862
Authors: 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
Recommendations
- A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs
- The spectral radius of graphs with no intersecting odd cycles
- Adjacency eigenvalues of graphs without short odd cycles
- The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size
- The spectral radius of graphs with no odd wheels
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Paths and cycles (05C38)
Cites Work
- The spectral radius of graphs without paths and cycles of specified length
- Title not available (Why is that?)
- The history of degenerate (bipartite) extremal graph problems
- Pancyclic graphs. I
- Bounds on graph eigenvalues. II
- On the theory of graphs
- Large cycles in graphs
- A spectral condition for odd cycles in graphs
- Sufficient Conditions for Circuits in Graphs†
- Spectral bounds for the clique and independence numbers of graphs
- Extensions of the Erdős–Gallai theorem and Luo’s theorem
- Extremal Numbers for Odd Cycles
- The spectral radius of graphs without long cycles
- Eigenvalues and triangles in graphs
Cited In (16)
- Maxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cycles
- A spectral Erdős-Rademacher theorem
- Signless Laplacian spectral radius of graphs without short cycles or long cycles
- Refinement on Spectral Turán’s Theorem
- Spectral extremal graphs without intersecting triangles as a minor
- A spectral condition for the existence of a pentagon in non-bipartite graphs
- 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
- Spectral extremal graphs for the bowtie
- On the sum of the k largest absolute values of Laplacian eigenvalues of digraphs
- The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size
- Spectral radius, edge-disjoint cycles and cycles of the same length
- A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- Spectral radius of graphs of given size with forbidden subgraphs
This page was built for publication: A spectral condition for odd cycles in non-bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238862)