Strongly Spanning Trailable Graphs with Small Circumference and Hamilton-Connected Claw-Free Graphs

2020 ◽  
Vol 37 (1) ◽  
pp. 65-85
Author(s):  
Xia Liu ◽  
Liming Xiong ◽  
Hong-Jian Lai
Keyword(s):  
Hamilton Connected

Spectral analogues of Erdős’ theorem on Hamilton-connected graphs

2019 ◽  
Vol 340 ◽  
pp. 242-250
Author(s):  
Jia Wei ◽  
Zhifu You ◽  
Hong-Jian Lai
Keyword(s):  
Connected Graphs ◽  
Hamilton Connected

scholarly journals Eulerian subgraphs and Hamilton-connected line graphs

2005 ◽  
Vol 145 (3) ◽  
pp. 422-428 ◽  
Author(s):  
Dengxin Li ◽  
Hong-Jian Lai ◽  
Mingquan Zhan
Keyword(s):  
Line Graphs ◽  
Eulerian Subgraphs ◽  
Hamilton Connected

scholarly journals Large Isaacs' graphs are maximally non- Hamilton-connected

1990 ◽  
Vol 82 (1) ◽  
pp. 101-104 ◽  
Author(s):  
Rafał Kalinowski ◽  
Zdzisław Skupień
Keyword(s):  
Hamilton Connected

scholarly journals Every 3-connected essentially 10-connected line graph is Hamilton-connected

2012 ◽  
Vol 312 (24) ◽  
pp. 3670-3674 ◽  
Author(s):  
Hao Li ◽  
Weihua Yang
Keyword(s):  
Line Graph ◽  
Hamilton Connected

scholarly journals Hamilton-Connected Mycielski Graphs∗

2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Yuanyuan Shen ◽  
Xinhui An ◽  
Baonyindureng Wu
Keyword(s):  
Generalized Petersen Graphs ◽  
Petersen Graphs ◽  
Hamilton Connected

Jarnicki, Myrvold, Saltzman, and Wagon conjectured that if G is Hamilton-connected and not K 2 , then its Mycielski graph μ G is Hamilton-connected. In this paper, we confirm that the conjecture is true for three families of graphs: the graphs G with δ G > V G / 2 , generalized Petersen graphs G P n , 2 and G P n , 3 , and the cubes G 3 . In addition, if G is pancyclic, then μ G is pancyclic.

scholarly journals Signless Laplacian Spectral Conditions for Hamiltonicity of Graphs

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Guidong Yu ◽  
Miaolin Ye ◽  
Gaixiang Cai ◽  
Jinde Cao
Keyword(s):  
Spectral Radius ◽  
Laplacian Spectral Radius ◽  
Signless Laplacian Spectral Radius ◽  
Signless Laplacian ◽  
Hamilton Connected

We establish some signless Laplacian spectral radius conditions for a graph to be Hamiltonian or traceable or Hamilton-connected.

scholarly journals Sufficient Spectral Radius Conditions for Hamilton-Connectivity of k-Connected Graphs

2021 ◽  
Author(s):  
Qiannan Zhou ◽  
Hajo Broersma ◽  
Ligong Wang ◽  
Yong Lu
Keyword(s):  
Spectral Radius ◽  
Connected Graph ◽  
Sufficient Conditions ◽  
Connected Graphs ◽  
Hamilton Connected

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.

Sign in / Sign up

Export Citation Format

Share Document