Abstract
In this paper, we establish some sufficient conditions for a graph to be Hamilton-connected in terms of the edge number, the spectral radius and the signless Laplacian spectral radius of the graph. Furthermore, we also give some sufficient conditions for a graph to be traceable from every vertex in terms of the edge number, the spectral radius and the signless Laplacian spectral radius.
Original language | English |
---|---|
Pages (from-to) | 224-234 |
Number of pages | 11 |
Journal | Linear and Multilinear Algebra |
Volume | 65 |
Issue number | 2 |
DOIs | |
State | Published - 1 Feb 2017 |
Keywords
- Hamilton-connected
- signless Laplacian spectral radius
- spectral radius
- traceable from every vertex