arXiv:1710.08641 [math.CO]AbstractReferencesReviewsResources
Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
Published 2017-10-24Version 1
In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result for balanced bipartite graphs. Additionally, we construct infinitely many graphs to show that results proved in this paper give new strength for one to determine the Hamiltonicity of graphs.
Comments: 12 pages, 1 figure
Journal: Linear and Multilinear Algebra, 2017
Categories: math.CO
Subjects: 05C50
Keywords: signless laplacian spectral radius, large minimum degree, hamiltonicity, tight sufficient condition, extremal graphs
Tags: journal article
Related articles: Most relevant | Search more
arXiv:2108.03895 [math.CO] (Published 2021-08-09)
The signless Laplacian spectral radius of graphs without intersecting odd cycles
arXiv:2209.03120 [math.CO] (Published 2022-09-07)
The signless Laplacian spectral radius of graphs without trees
arXiv:1501.03129 [math.CO] (Published 2015-01-13)
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity