Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
Combinatorics
2017-12-01 v1
Abstract
In this paper, we present a spectral sufficient condition for a graph to be Hamilton-connected in terms of signless Laplacian spectral radius with large minimum degree.
Keywords
Cite
@article{arxiv.1711.11257,
title = {Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree},
author = {Qiannan Zhou and Ligong Wang and Yong Lu},
journal= {arXiv preprint arXiv:1711.11257},
year = {2017}
}
Comments
14 pages