An improvement of spectral conditions for Hamilton-connected graphs

Author(s):  
Yi Xu ◽  
Mingqing Zhai ◽  
Bing Wang
2019 ◽  
Vol 340 ◽  
pp. 242-250
Author(s):  
Jia Wei ◽  
Zhifu You ◽  
Hong-Jian Lai

Author(s):  
Qiannan Zhou ◽  
Hajo Broersma ◽  
Ligong Wang ◽  
Yong Lu

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.


2019 ◽  
Vol 2019 ◽  
pp. 1-9
Author(s):  
Guisheng Jiang ◽  
Lifang Ren ◽  
Guidong Yu

In this paper, with respect to the Wiener index, hyper-Wiener index, and Harary index, it gives some sufficient conditions for some graphs to be traceable, Hamiltonian, Hamilton-connected, or traceable for every vertex. Firstly, we discuss balanced bipartite graphs with δG≥t, where δG is the minimum degree of G, and gain some sufficient conditions for the graphs to be traceable or Hamiltonian, respectively. Secondly, we discuss nearly balanced bipartite graphs with δG≥t and present some sufficient conditions for the graphs to be traceable. Thirdly, we discuss graphs with δG≥t and obtain some conditions for the graphs to be traceable or Hamiltonian, respectively. Finally, we discuss t-connected graphs and provide some conditions for the graphs to be Hamilton-connected or traceable for every vertex, respectively.


Sign in / Sign up

Export Citation Format

Share Document