Spectral conditions for the existence of specified paths and cycles in graphs
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.