Spectral conditions for the existence of specified paths and cycles in graphs

2013/09/26 by Mingqing Zhai, Huiqiu Lin, Zhai, Mingqing +3 · 1 citation
Mathematics · #Graph theory and applications #Finite Group Theory Research #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1309.6700

Abstract

Let G be a graph with n vertices and λ_n(G) be the least eigenvalue of its adjacency matrix of G. In this paper, we give sharp bounds on the least eigenvalue of graphs without given pathes or cycles and determine the extremal graphs. This result gives spectral conditions for the existence of specified paths and cycles in graphs.

Cited by

• The high order spectral radius of graphs without long cycles or paths

Related

• Eigenvalues and forbidden subgraphs I
• Some observations on the smallest adjacency eigenvalue of a graph
• Adjacency eigenvalues of graphs without short odd cycles
• The spectral radius of graphs without paths and cycles of specified length
• Combinatorial upper bounds for the smallest eigenvalue of a graph