arXiv Analytics

Sign in

arXiv:0903.5353 [math.CO]AbstractReferencesReviewsResources

Spectral radius and Hamiltonicity of graphs

Miroslav Fiedler, Vladimir Nikiforov

Published 2009-03-31Version 1

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.

Categories: math.CO
Subjects: 05C35, 05C50
Related articles: Most relevant | Search more
arXiv:1309.0217 [math.CO] (Published 2013-09-01, updated 2014-07-20)
Spectral radius and Hamiltonian properties of graphs
arXiv:1609.00835 [math.CO] (Published 2016-09-03)
On the $A_α$-spectra of trees
arXiv:1301.0374 [math.CO] (Published 2013-01-03, updated 2013-01-05)
The triangle-free graphs with rank 6

Links

Toolbox