The Structure Fault-Tolerance of Enhanced Hypercube Networks
Abstract
An important indicator of a network’s robustness is the connectivity of the network which is directly related to its reliability and fault tolerability. Let H be a connected subgraph of graph G. the H-structure-connectivity of graph G, denoted by ï«( G, H), is the cardinality of a minimal set of subgraphs F={ J1, J2, … , Jm }, such that every element of F is isomorphic to H, and Gï€F is disconnected. The H-substructure-connectivity of graph G, denoted by ï«s(G,H), is the cardinality of a minimal set of subgraphs F={ J1, J2, … , Jm }, such that every is a connected subgraph of H, and Gï€F is disconnected. In this paper, the H-structure-connectivity ï«( Qn,k, H) and ï«s(Qn,k, H) are considered in enhanced hypercube Qn,k when H{ P1, P2}.
Keywords
Enhanced hypercubes, Structure connectivity, Fault-tolerance
DOI
10.12783/dtetr/ecar2018/26350
10.12783/dtetr/ecar2018/26350
Refbacks
- There are currently no refbacks.