Hamiltonian Cycles Passing Through Prescribed Edges in Locally Twisted Cubes

被引:1
|
作者
Cheng, Dongqin [1 ]
机构
[1] Jinan Univ, Dept Math, Guangzhou 510632, Peoples R China
关键词
Interconnection network; locally twisted cube; Hamiltonian cycle; Prescribed edges; INDEPENDENT SPANNING-TREES; FOLDED HYPERCUBES; PATHS;
D O I
10.1142/S0219265921500201
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Let P be a set of edges whose induced subgraph consists of vertex-disjoint paths in an n-dimensional locally twisted cube LTQ(n). In this paper, we prove that if P contains at most n - 1 edges, then LTQ(n) contains a Hamiltonian cycle passing through every edge of P, where n >= 4. LTQ(3) has a Hamiltonian cycle passing through at most one prescribed edge.
引用
收藏
页数:13
相关论文
共 50 条