English

Structure connectivity and substructure connectivity of twisted hypercubes

Combinatorics 2018-03-23 v1

Abstract

Let GG be a graph and TT a certain connected subgraph of GG. The TT-structure connectivity κ(G;T)\kappa(G; T) (or resp., TT-substructure connectivity κs(G;T)\kappa^{s}(G; T)) of GG is the minimum number of a set of subgraphs F={T1,T2,,Tm}\mathcal{F}=\{T_{1}, T_{2}, \ldots, T_{m}\} (or resp., F={T1,T2,,Tm}\mathcal{F}=\{T^{'}_{1}, T^{'}_{2}, \ldots, T^{'}_{m}\}) such that TiT_{i} is isomorphic to TT (or resp., TiT^{'}_{i} is a connected subgraph of TT) for every 1im1\leq i \leq m, and F\mathcal{F}'s removal will disconnect GG. The twisted hypercube HnH_{n} is a new variant of hypercubes with asymptotically optimal diameter introduced by X.D. Zhu. In this paper, we will determine both κ(Hn;T)\kappa(H_{n}; T) and κs(Hn;T)\kappa^{s}(H_{n}; T) for T{K1,r,Pk}T\in\{K_{1,r}, P_{k}\}, respectively, where 3r43\leq r\leq 4 and 1kn1 \leq k \leq n.

Keywords

Cite

@article{arxiv.1803.08408,
  title  = {Structure connectivity and substructure connectivity of twisted hypercubes},
  author = {Dong Li and Xiaolan Hu and Huiqing Liu},
  journal= {arXiv preprint arXiv:1803.08408},
  year   = {2018}
}

Comments

19 pages, 2 figures

R2 v1 2026-06-23T01:01:57.518Z