A spectral condition for odd cycles in non-bipartite graphs
From MaRDI portal
Publication:2238862
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
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- A spectral condition for odd cycles in graphs
- Bounds on graph eigenvalues. II
- Eigenvalues and triangles in graphs
- Extensions of the Erdős-Gallai theorem and Luo's theorem
- Extremal numbers for odd cycles
- Large cycles in graphs
- On the theory of graphs
- Pancyclic graphs. I
- Spectral bounds for the clique and independence numbers of graphs
- Sufficient Conditions for Circuits in Graphs†
- The history of degenerate (bipartite) extremal graph problems
- The spectral radius of graphs without long cycles
- The spectral radius of graphs without paths and cycles of specified length
Cited in
(18)- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- On the sum of the k largest absolute values of Laplacian eigenvalues of digraphs
- A spectral condition for the existence of a pentagon in non-bipartite graphs
- The spectral radius of graphs with no odd wheels
- The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size
- Spectral extremal graphs without intersecting triangles as a minor
- 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
- Refinement on Spectral Turán’s Theorem
- A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs
- Signless Laplacian spectral radius of graphs without short cycles or long cycles
- Maxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cycles
- The spectral radius of graphs with no intersecting odd cycles
- A spectral Erdős-Rademacher theorem
- Spectral extremal graphs for the bowtie
- Spectral radius of graphs of given size with forbidden subgraphs
- Spectral radius, edge-disjoint cycles and cycles of the same length
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)