Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
classification
🧮 math.CO
keywords
graphshamiltonicitydegreelaplacianlargeminimumradiussignless
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.