Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.