Signless Laplacian Spread and Hamiltonicity of Graphs Signless Laplacian Spread and Hamiltonicity of Graphs

Main Article Content

Rao Li

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

How to Cite
Li, R. (2018). Signless Laplacian Spread and Hamiltonicity of Graphs: Signless Laplacian Spread and Hamiltonicity of Graphs. Asian Journal of Mathematical Sciences(AJMS), 1(02). Retrieved from http://ajms.in/index.php/ajms/article/view/107
Section
Review Articles