arXiv Analytics

Sign in

arXiv:1711.03019 [math.CO]AbstractReferencesReviewsResources

Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius

Qiannan Zhou, Ligong Wang, Yong Lu

Published 2017-11-08Version 1

In this paper, we present some spectral sufficient conditions for a graph to be Hamilton-connected in terms of the spectral radius or signless Laplacian spectral radius of the graph. Our results improve some previous work.

Comments: 18 pages, 2 figures
Categories: math.CO
Subjects: 05C50, 05C45
Related articles: Most relevant | Search more
arXiv:2303.16687 [math.CO] (Published 2023-03-29)
Signless Laplacian spectral radius for a k-extendable graph
arXiv:2007.08627 [math.CO] (Published 2020-07-15)
The signless Laplacian spectral radius of graphs with forbidding linear forests
arXiv:1209.3214 [math.CO] (Published 2012-09-14)
Sharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number

Links

Toolbox