Hamiltonian cycles and Hamiltonian paths in faulty burnt pancake graphs

被引：20

作者：

Kaneko, Keiichi ^{[1
]}

机构：

[1] Tokyo Univ Agr & Technol, Grad Sch Engn, Koganei, Tokyo 1848588, Japan

来源：

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2007年 / E90D卷 / 04期

关键词：

signed permutation; interconnection network; routing algorithm; parallel processing;

D O I：

10.1093/ietisy/e90-d.4.716

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Recently, research on parallel processing systems is very active, and many complex topologies have been proposed. A burnt pancake graph is one such topology. In this paper, we prove that a faulty burnt pancake graph with degree n has a fault-free Hamiltonian cycle if the number of the faulty elements is n-2 or less, and it has a fault-free Hamiltonian path between any pair of nonfaulty nodes if the number of the faulty elements is n - 3 or less.

引用

页码：716 / 721

页数：6

共 50 条

[1] Embedding Hamiltonian paths and Hamiltonian cycles in faulty pancake graphs
Hung, CN
Liang, KY
Hsu, LH
[J]. I-SPAN'02: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2002, : 179 - 184
[2] Mutually Independent Hamiltonian Cycle of Burnt Pancake Graphs
Lai, Yung-Ling
Yu, Da-Chung
Hsu, Lih-Hsing
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (07) : 1553 - 1557
[3] Hamiltonian cycles and paths in faulty twisted hypercubes
Liu, Huiqing
Hu, Xiaolan
Gao, Shan
[J]. DISCRETE APPLIED MATHEMATICS, 2019, 257 : 243 - 249
[4] Mutually independent hamiltonian cycles for the pancake graphs and the star graphs
Department of Computer Science, National Chiao Tung University, Hsinchu, 30010, Taiwan
不详
不详
不详
[J]. Discrete Math, 17 (5474-5483):
[5] Mutually independent hamiltonian cycles for the pancake graphs and the star graphs
Lin, Cheng-Kuan
Tan, Jimmy J. M.
Huang, Hua-Min
Hsu, D. Frank
Hsu, Lih-Hsing
[J]. DISCRETE MATHEMATICS, 2009, 309 (17) : 5474 - 5483
[6] Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
Dybizbanski, Janusz
Szepietowski, Andrzej
[J]. INFORMATION PROCESSING LETTERS, 2021, 172 (172)
[7] On Hamiltonian cycles and Hamiltonian paths
Rahman, MS
Kaykobad, M
[J]. INFORMATION PROCESSING LETTERS, 2005, 94 (01) : 37 - 41
[8] Orbits of Hamiltonian Paths and Cycles in Complete Graphs
Herman, Samuel
Poimenidou, Eirini
[J]. JOURNAL OF INTEGER SEQUENCES, 2020, 23 (07)
[9] Long cycles in graphs without hamiltonian paths
Kawarabayashi, Ken-ichi
Ozeki, Kenta
Yamashita, Tomoki
[J]. DISCRETE MATHEMATICS, 2008, 308 (24) : 5899 - 5906
[10] Embedding Hamiltonian paths in faulty arrangement graphs with the backtracking method
Lo, RS
Chen, GH
[J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2001, 12 (02) : 209 - 222

← 1 2 3 4 5 →