Abstract
AbstractWe present two new sufficient conditions in terms of the spectral radius $$\rho (G)$$
ρ
(
G
)
guaranteeing that a k-connected graph G is Hamilton-connected, unless G belongs to a collection of exceptional graphs. We use the Bondy–Chvátal closure to characterize these exceptional graphs.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference24 articles.
1. Benediktovich, V.: Sufficient spectral condition for hamiltonicity of a graph. Linear Algebra Appl. 494, 70–79 (2016)
2. Bondy, J.A., Chvátal, V.: A method in graph theory. Discrete Math. 15, 111–135 (1976)
3. Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics, vol. 244. Springer, London (2008)
4. Brouwer, A.E., Haemers, W.H.: Spectra of Graphs. Springer, New York (2011)
5. Chen, X.D., Hou, Y.P., Qian, J.G.: Sufficient conditions for hamiltonian graphs in terms of (signless Laplacian) spectral radius. Linear Multilinear Algebra 66, 919–936 (2018)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献