Spectral Results on Some Hamiltonian Properties of Graphs
Using Lotker’s interlacing theorem on the Laplacian eigenvalues of a graph in [5] and Wang and Belardo’s interlacing theorem on the signless Laplacian eigenvalues of a graph in [6], we in this note obtain spectral conditions for some Hamiltonian properties of graphs
Main Author: | Rao Li |
---|---|
Format: | Article |
Language: | English |
Published: |
Conspress
2014-10-01
|
Series: | Romanian Journal of Mathematics and Computer Science |
Subjects: | |
Online Access: | http://www.rjm-cs.ro/RaoLi.2014.pdf |
Similar Items
-
The sum of the largest and smallest signless laplacian eigenvalues and some Hamiltonian properties of graphs
by: Rao Li
Published: (2018-09-01) -
Seidel Signless Laplacian Energy of Graphs
by: Harishchandra Ramane, et al.
Published: (2017-12-01) -
Color signless Laplacian energy of graphs
by: Pradeep G. Bhat, et al.
Published: (2017-08-01) -
Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
by: Huicai Jia, et al.
Published: (2018-04-01) -
Graphs with the second signless Laplacian eigenvalue ≤ 4
by: Drury Stephen
Published: (2021-12-01)