Spectral conditions for a graph to be Hamilton-connected
Combinatorics
2014-09-19 v1
Abstract
In this paper we establish some spectral conditions for a graph to be Hamilton-connected in terms of the spectral radius of the adjacency matrix or the signless Laplacian of the graph or its complement. For the existence of Hamiltonian paths or cycles in a graph, we also give a sufficient condition by the signless Laplacian spectral radius.
Cite
@article{arxiv.1207.6447,
title = {Spectral conditions for a graph to be Hamilton-connected},
author = {Gui-Dong Yu and Yi-Zheng Fan},
journal= {arXiv preprint arXiv:1207.6447},
year = {2014}
}