Spectral radius and Hamiltonicity of graphs
Combinatorics
2009-04-01 v1
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.
Cite
@article{arxiv.0903.5353,
title = {Spectral radius and Hamiltonicity of graphs},
author = {Miroslav Fiedler and Vladimir Nikiforov},
journal= {arXiv preprint arXiv:0903.5353},
year = {2009}
}