Structure and substructure connectivity of balanced hypercubes
Abstract
The connectivity of a network directly signifies its reliability and fault-tolerance. Structure and substructure connectivity are two novel generalizations of the connectivity. Let H be a subgraph of a connected graph G. The structure connectivity (resp. substructure connectivity) of G, denoted by (G;H) (resp. s(G;H)), is defined to be the minimum cardinality of a set F of connected subgraphs in G, if exists, whose removal disconnects G and each element of F is isomorphic to H (resp. a subgraph of H). In this paper, we shall establish both (BHn;H) and s(BHn;H) of the balanced hypercube BHn for H∈\K1,K1,1,K1,2,K1,3,C4\.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.