Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
classification
🧮 math.CO
keywords
spectralradiusconditionsgraphhamilton-connectedlaplaciansignlesssome
read the original abstract
In this paper, we present some spectral sufficient conditions for a graph to be Hamilton-connected in terms of the spectral radius or signless Laplacian spectral radius of the graph. Our results improve some previous work.
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.