A spectral condition for the existence of a pentagon in non-bipartite graphs

DOI10.1016/j.laa.2021.06.002zbMath1468.05153OpenAlexW3165892239MaRDI QIDQ2041769

Huiqiu Lin, Hangtian Guo, Yanhua Zhao

Publication date: 23 July 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.06.002

zbMATH Keywords

spectral radiusadjacency matrixpentagonnon-bipartite graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Refinement on Spectral Turán’s Theorem ⋮ Spectral radius of graphs of given size with forbidden subgraphs ⋮ A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• Degree powers in \(C_5\)-free graphs
• The spectral radius of graphs without paths and cycles of specified length
• The maximum spectral radius of \(C_4\)-free graphs of given order and size
• The spectral radius of graphs on surfaces
• The spectral radius of graphs without long cycles
• On the spectrum of an equitable quotient matrix and its application
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• A new upper bound for the spectral radius of graphs with girth at least 5
• A spectral condition for odd cycles in graphs
• Eigenvalues and triangles in graphs
• Extensions of the Erdős–Gallai theorem and Luo’s theorem
• Extremal Numbers for Odd Cycles

This page was built for publication: A spectral condition for the existence of a pentagon in non-bipartite graphs