Sufficient spectral conditions on Hamiltonian and traceable graphs
classification
🧮 math.CO
keywords
conditionshamiltonianspectralsufficienttraceablegraphradiusresults
read the original abstract
In this paper, we give sufficient conditions on the spectral radius for a bipartite graph to Hamiltonian and traceable, which expand the results of Lu, Liu and Tian (2012) [10]. Furthermore, we also present tight sufficient conditions on the signless Laplacian spectral radius for a graph to Hamiltonian and traceable, which improve the results of Yu and Fan (2012) [12].
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.