Panconnectivity for Interconnection Networks with Faulty Elements
نویسندگان
چکیده
Let G0 and G1 be two graphs with the same vertices. The new graph G(G0, G1;M) is a graph with the vertex set V (G0)∪V (G1) and the edge set E(G0)∪E(G1)∪M , where M is an arbitrary perfect matching between the vertices of G0 and G1, i.e., a set of cross edges with one endvertex in G0 and the other endvertex in G1. In this paper, we will show that if G0 and G1 are f -fault q-panconnected, then for any f ≥ 2, G(G0, G1;M) is (f + 1)-fault (q + 2)-panconnected.
منابع مشابه
Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements
In this paper, we deal with the graph G0⊕G1 obtained from merging two graphs G0 and G1 with n vertices each by n pairwise nonadjacent edges joining vertices in G0 and vertices in G1. The main problems studied are how fault-panconnectivity and fault-pancyclicity of G0 and G1 are translated into fault-panconnectivity and fault-pancyclicity of G0⊕G1, respectively. Many interconnection networks suc...
متن کاملTesting the Dynamic Full Access Property of a Class of Multistage Interconnection Networks
A banyan network and its topologically equivalent ones have recently been adopted as the interconnection networks in a multiprocessor system. Often a multiprocessor system is reconfigured when the banyan network becomes faulty. It is possible to avoid a complicated reconfiguration process as long as the faulty banyan network still possesses the dynamic full access (DFA) property. In this short ...
متن کاملPanconnectivity and edge-pancyclicity of faulty recursive circulant G(2m, 4)
In this paper, we investigate a problem on embedding paths into recursive circulant G(2, 4) with faulty elements (vertices and/or edges) and show that each pair of vertices in recursive circulant G(2, 4), m ≥ 3, are joined by a fault-free path of every length from m + 1 to |V (G(2, 4)\F )| − 1 inclusive for any fault set F with |F | ≤ m− 3. The bound m−3 on the number of acceptable faulty eleme...
متن کاملFault-Tolerant Multicasting in Multistage Interconnection Networks
In this paper, we study fault-tolerant multicasting in multistage interconnection networks (MINs) for constructing large-scale multicomputers. In addition to point-to-point routing among processor nodes, efficient multicasting is critical to the performance of multicomputers. This paper presents a new approach to provide fault-tolerance multicasting, which employs the restricted header encoding...
متن کاملPanconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
Jwo et al. [Networks 23 (1993) 315–326] introduced the alternating group graph as an interconnection network topology for computing systems. They showed that the proposed structure has many advantages over n-cubes and star graphs. For example, all alternating group graphs are hamiltonian-connected (i.e., every pair of vertices in the graph are connected by a hamiltonian path) and pancyclic (i.e...
متن کامل