scholarly journals Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes

2011 ◽  
Vol 412 (35) ◽  
pp. 4747-4753 ◽  
Author(s):  
Ruo-Wei Hung
Keyword(s):  
Hamiltonian Cycles ◽  
Edge Disjoint ◽  
Locally Twisted Cubes ◽  
Twisted Cubes

Hamiltonian Cycles Passing Through Prescribed Edges in Locally Twisted Cubes

2021 ◽  
Author(s):  
Dongqin Cheng
Keyword(s):  
Hamiltonian Cycle ◽  
Disjoint Paths ◽  
Hamiltonian Cycles ◽  
Induced Subgraph ◽  
Locally Twisted Cubes ◽  
Twisted Cube ◽  
Vertex Disjoint ◽  
Cube Formula ◽  
Twisted Cubes

Let [Formula: see text] be a set of edges whose induced subgraph consists of vertex-disjoint paths in an [Formula: see text]-dimensional locally twisted cube [Formula: see text]. In this paper, we prove that if [Formula: see text] contains at most [Formula: see text] edges, then [Formula: see text] contains a Hamiltonian cycle passing through every edge of [Formula: see text], where [Formula: see text]. [Formula: see text] has a Hamiltonian cycle passing through at most one prescribed edge.

Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes

2010 ◽  
Vol 110 (10) ◽  
pp. 414-419 ◽  
Author(s):  
Jia-Cian Lin ◽  
Jinn-Shyong Yang ◽  
Chiun-Chieh Hsu ◽  
Jou-Ming Chang
Keyword(s):  
Spanning Trees ◽  
Edge Disjoint ◽  
Locally Twisted Cubes ◽  
Independent Spanning Trees ◽  
Twisted Cubes

Conditional Edge Connectivity of the Locally Twisted Cubes

2019 ◽  
Vol 7 (3) ◽  
pp. 501-509
Author(s):  
Hui Shang ◽  
Eminjan Sabir ◽  
Ji-Xiang Meng
Keyword(s):  
Edge Connectivity ◽  
Locally Twisted Cubes ◽  
Twisted Cubes
Sign in / Sign up

Export Citation Format

Share Document