Optimal Fault-Tolerant Hamiltonian and Hamiltonian Connected Graphs

2008 ◽  
Author(s):  
Y-Chuang Chen ◽  
Yong-Zen Huang ◽  
Lih-Hsing Hsu ◽  
Jimmy J. M. Tan ◽  
Theodore E. Simos ◽  
...  
Keyword(s):  
Fault Tolerant ◽  
Connected Graphs ◽  
Hamiltonian Connected

Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs

1987 ◽  
Vol 18 (11) ◽  
pp. 50-60
Author(s):  
Koichi Wada ◽  
Kimio Kawaguchi ◽  
Yupin Luo
Keyword(s):  
Fault Tolerant ◽  
Connected Graphs

A note on locally connected and hamiltonian-connected graphs

1979 ◽  
Vol 33 (1) ◽  
pp. 5-8 ◽  
Author(s):  
Gary Chartrand ◽  
Ronald J. Gould ◽  
Albert D. Polimeni
Keyword(s):  
Connected Graphs ◽  
Hamiltonian Connected

scholarly journals Mutually orthogonal hamiltonian connected graphs

2009 ◽  
Vol 22 (9) ◽  
pp. 1429-1431 ◽  
Author(s):  
Tung-Yang Ho ◽  
Cheng-Kuan Lin ◽  
Jimmy J.M. Tan ◽  
Lih-Hsing Hsu
Keyword(s):  
Connected Graphs ◽  
Hamiltonian Connected

scholarly journals Maximum graphs non-Hamiltonian-connected from a vertex

1984 ◽  
Vol 25 (1) ◽  
pp. 97-98
Author(s):  
G. R. T. Hendry
Keyword(s):  
Hamiltonian Cycle ◽  
Hamiltonian Path ◽  
Hamiltonian Graphs ◽  
Connected Graphs ◽  
Hamiltonian Connected

A path (cycle) in a graph G is called a hamiltonian path (cycle) of G if it contains every vertex of G. A graph is hamiltonian if it contains a hamiltonian cycle. A graph G is hamiltonian-connectedif it contains a u-vhamiltonian path for each pair u, v of distinct vertices of G. A graph G is hamiltonian-connected from a vertex v of G if G contains a v-whamiltonian path for each vertex w≠v. Considering only graphs of order at least 3, the class of graphs hamiltonian-connected from a vertex properly contains the class of hamiltonian-connected graphs and is properly contained in the class of hamiltonian graphs.

Dirac type condition and Hamiltonian-connected graphs

2011 ◽  
Vol 34 (4) ◽  
pp. 521-525
Author(s):  
Deqin Chen ◽  
Zu Li ◽  
Kewen Zhao*
Keyword(s):  
Type Condition ◽  
Connected Graphs ◽  
Dirac Type ◽  
Hamiltonian Connected
Sign in / Sign up

Export Citation Format

Share Document