Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree

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.

Locations

• Linear and Multilinear Algebra - View
• arXiv (Cornell University) - View - PDF
• DataCite API - View