Structure connectivity and substructure connectivity of twisted hypercubes
Abstract
Let G be a graph and T a certain connected subgraph of G. The T-structure connectivity (G; T) (or resp., T-substructure connectivity s(G; T)) of G is the minimum number of a set of subgraphs F=\T1, T2, …, Tm\ (or resp., F=\T'1, T'2, …, T'm\) such that Ti is isomorphic to T (or resp., T'i is a connected subgraph of T) for every 1≤ i ≤ m, and F's removal will disconnect G. The twisted hypercube Hn is a new variant of hypercubes with asymptotically optimal diameter introduced by X.D. Zhu. In this paper, we will determine both (Hn; T) and s(Hn; T) for T∈\K1,r, Pk\, respectively, where 3≤ r≤ 4 and 1 ≤ k ≤ n.
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.