منابع مشابه
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 node...
متن کاملThe n-Dimensional Burnt Pancake Graph is n∗-connected
A k-container C(u, v) of a graph G is a set of kdisjoint paths joining u to v. A k-container C(u, v) of G is k∗-container if C(u, v) spans G. A graph G is k∗-connected if there exists a k∗-container between any two distinct vertices. Let κ(G) be the connectivity of G. In this paper, we prove that the n-dimensional burnt pancake graph Bn is n∗connected for any positive integer n.
متن کامل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...
متن کاملStrong matching preclusion of burnt pancake graphs
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The burnt pancake graph is a more complex variant of the pancake graph. In this talk, we examine the properties ...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.08.008