Spectral Condition for a Graph to be Hamiltonian with respect to Normalized Laplacian
Combinatorics
2012-07-31 v1
Abstract
Let G be a graph and let \Delta,\delta be the maximum and minimum degrees of G respectively, where \Delta/\delta<c<\sqrt{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.
Keywords
Cite
@article{arxiv.1207.6824,
title = {Spectral Condition for a Graph to be Hamiltonian with respect to Normalized Laplacian},
author = {Yi-Zheng Fan and Gui-Dong Yu},
journal= {arXiv preprint arXiv:1207.6824},
year = {2012}
}