Hamiltonian Paths and Cycles in Faulty Burnt Pancake Graphs
نویسنده
چکیده
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 faulty elements is no more than n − 2, and it has a fault-free Hamiltonian path between any pair of non-faulty nodes if the number of faulty elements is no more than n− 3.
منابع مشابه
Fault-tolerant routing in burnt pancake graphs
Recently, researches of parallel distributed computation are getting more important. Especially, massively parallel systems are studied with enthusiasm, and many topologies have been proposed. Since multiple faulty elements are expected in a massively parallel system, fault-tolerant routing is also studied eagerly for communication avoiding the faulty elements [4,6,8]. In this study, we focus o...
متن کاملThe Spanning Connectivity of the Burnt Pancake Graphs
Let u and v be any two distinct vertices of an undirected graph G, which is k-connected. For 1 ≤ w ≤ k, a w-container C(u, v) of a k-connected graph G is a set of w-disjoint paths joining u and v. A wcontainer C(u, v) of G is a w∗-container if it contains all the vertices of G. A graph G is w∗-connected if there exists a w∗-container between any two distinct vertices. Let κ(G) be the connectivi...
متن کاملMutually Independent Hamiltonian Cycle of Burnt Pancake Graphs
Let ( ) , G V E = be a graph of order n. A Hamiltonian cycle of G is a cycle contains every vertex in G. Two Hamiltonian cycles 1 1 2 3 1 , , ,... , n C u u u u u = and C2 = 1 2 3 1 , , ,... , n v v v v v of G are independent if 1 1 u v = and i i u v ≠ for 2 i n ≤ ≤ . A set of Hamiltonian cycles { } 1 2 3 , , ,... k C C C C of G is mutually independent if its elements are pairwise independent. ...
متن کاملNode-to-Set Disjoint Paths Problem in Burnt Pancake Graphs
A burnt pancake graph is a variant of Cayley graphs and its topology is suitable for massively parallel systems. However, for a burnt pancake graph, there is much room for further research. Hence, in this study, we focus on n-burnt pancake graphs and propose an algorithm to obtain n disjoint paths from a source node to n destination nodes in polynomial order time of n, n being the degree of the...
متن کاملCycle embedding in pancake interconnection networks
The ring structure is important for distributed computing, and it is useful to construct a hamiltonian cycle or rings of various length in the network. Kanevsky and Feng [3] proved that all cycles of length l where 6 ≤ l ≤ n!−2 or l = n! can be embedded in the pancake graphs Gn. Later, Senoussi and Lavault [9] presented the embedding of ring of length l, 3 ≤ l ≤ n!, with dilation 2 in the panca...
متن کامل