Embeddings of hamiltonian paths in faulty k-ary 2-cubes
نویسندگان
چکیده
It is well known that the k-ary n-cube has been one of the most efficient interconnection networks for distributed-memory parallel systems. A k-ary n-cube is bipartite if and only if k is even. Let (X,Y ) be a bipartition of a k-ary 2-cube (even integer k ≥ 4). In this paper, we prove that for any two healthy vertices u ∈ X, v ∈ Y , there exists a hamiltonian path from u to v in the faulty k-ary 2-cube with one faulty vertex in each part.
منابع مشابه
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
In this paper, we investigate the fault-tolerant capabilities of the k-ary n-cubes for even integer k with respect to the hamiltonian and hamiltonian-connected properties. The k-ary n-cube is a bipartite graph if and only if k is an even integer. Let F be a faulty set with nodes and/or links, and let k 3 be an odd integer. When |F | 2n−2, we show that there exists a hamiltonian cycle in a wound...
متن کاملFault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
We consider the fault-tolerant capabilities of networks of processors whose underlying topology is that of the k-ary n-cube Qn, where k ≥ 3 and n ≥ 2. In particular, given a copy of Qn where some of the interprocessor links may be faulty but where every processor is incident with at least two healthy links, we show that if the number of faults is at most 4n− 5, then Qn still contains a Hamilton...
متن کاملOn Cycle Embeddings of Cube Families
In this dissertation, we investigate fault-tolerant capabilities of the k-ary n-cubes with respect to the hamiltonian and hamiltonian connected properties. The k-ary n-cube is a bipartite graph if and only if k is an even integer. Let F be a faulty set with nodes and/or links, and let k ≥ 3 be an odd integer. When |F | ≤ 2n − 2, we show that there exists a hamiltonian cycle in a wounded k-ary n...
متن کاملEmbedding long cycles in faulty k-ary 2-cubes
The class of k-ary n-cubes represents the most commonly used interconnection topology for distributed-memory parallel systems. Given an even k P 4, let (V1,V2) be the bipartition of the k-ary 2-cube, fv1, fv2 be the numbers of faulty vertices in V1 and V2, respectively, and fe be the number of faulty edges. In this paper, we prove that there exists a cycle of length k 2max{fv1, fv2} in the k-ar...
متن کاملPancyclicity in Faulty K-ary 2-cubes
We prove that a k-ary 2-cube Q2 with 3 faulty edges but where every vertex is incident with at least 2 healthy edges is bipancyclic, if k ≥ 3, and k-pancyclic, if k ≥ 5 is odd (these results are optimal).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 32 شماره
صفحات -
تاریخ انتشار 2012