Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Bounds on Signless Laplacian Eigenvalues of Hamiltonian Graphs

Bounds on Signless Laplacian Eigenvalues of Hamiltonian Graphs We give an upper bound on the largest eigenvalue of the signless Laplacian matrix of a Hamiltonian graph. This bound is applied to obtain sufficient spectral conditions for the non-existence of Hamiltonian cycles. Under certain additional assumptions we provide a polynomial time decisive spectral criterion for the Hamiltonicity of a given graph with sufficiently large minimum vertex degree. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Bulletin of the Brazilian Mathematical Society, New Series Springer Journals

Bounds on Signless Laplacian Eigenvalues of Hamiltonian Graphs

Loading next page...
 
/lp/springer-journals/bounds-on-signless-laplacian-eigenvalues-of-hamiltonian-graphs-FBSX3ryCtB

References (20)

Publisher
Springer Journals
Copyright
Copyright © Sociedade Brasileira de Matemática 2020. corrected publication 2021
ISSN
1678-7544
eISSN
1678-7714
DOI
10.1007/s00574-020-00211-y
Publisher site
See Article on Publisher Site

Abstract

We give an upper bound on the largest eigenvalue of the signless Laplacian matrix of a Hamiltonian graph. This bound is applied to obtain sufficient spectral conditions for the non-existence of Hamiltonian cycles. Under certain additional assumptions we provide a polynomial time decisive spectral criterion for the Hamiltonicity of a given graph with sufficiently large minimum vertex degree.

Journal

Bulletin of the Brazilian Mathematical Society, New SeriesSpringer Journals

Published: Jun 16, 2020

Keywords: Signless Laplacian matrix; Largest eigenvalue; Hamiltonian graph; Spectral inequalities; 05C50; 05C35

There are no references for this article.