Spectral Condition for a Graph to be Hamiltonian with respect to Normalized Laplacian
Abstract
Let G be a graph and let ,δ be the maximum and minimum degrees of G respectively, where /δ<c<2 and c is a constant. In this paper we establish a sufficient spectral condition for the graph G to be Hamiltonian, that is, the nontrivial eigenvalues of the normalized Laplacian of G are sufficiently close to 1.
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.