Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
classification
🧮 math.CO
keywords
spectraldegreehamilton-connectedlaplacianlargeminimumsignlesscondition
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.