Spectral radius and Hamiltonicity of graphs
Abstract
Let G be a graph of given order and mu(G) be the largest eigenvalue of its adjacency matrix. We give conditions on mu(G) that imply Hamiltonicity of G and of its complement.
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.