Signless Laplacian Spread and Hamiltonicity of Graphs Signless Laplacian Spread and Hamiltonicity of Graphs
Main Article Content
Abstract
The signless Laplacian spread of a graph G is the difference between the largest and smallest signless Lapacian eigenvalues of G. Using a result on the signless Laplacian spread obtained by Liu and Liu in [3], we in this note present a sufficient condition based on the signless Laplacian spread for the Hamiltonicity of graphs. 2010 Mathematics Subject Classification: 05C50, 05C45.
Article Details
Section
Review Articles
This is an Open Access article distributed under the terms of the Attribution-Noncommercial 4.0 International License [CC BY-NC 4.0], which requires that reusers give credit to the creator. It allows reusers to distribute, remix, adapt, and build upon the material in any medium or format, for noncommercial purposes only.