English

Structure and substructure connectivity of balanced hypercubes

Combinatorics 2018-08-08 v1 Discrete Mathematics

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 HH be a subgraph of a connected graph GG. The structure connectivity (resp. substructure connectivity) of GG, denoted by κ(G;H)\kappa(G;H) (resp. κs(G;H)\kappa^s(G;H)), is defined to be the minimum cardinality of a set FF of connected subgraphs in GG, if exists, whose removal disconnects GG and each element of FF is isomorphic to HH (resp. a subgraph of HH). In this paper, we shall establish both κ(BHn;H)\kappa(BH_n;H) and κs(BHn;H)\kappa^s(BH_n;H) of the balanced hypercube BHnBH_n for H{K1,K1,1,K1,2,K1,3,C4}H\in\{K_1,K_{1,1},K_{1,2},K_{1,3},C_4\}.

Keywords

Cite

@article{arxiv.1808.02375,
  title  = {Structure and substructure connectivity of balanced hypercubes},
  author = {Huazhong Lü and Tingzeng Wu},
  journal= {arXiv preprint arXiv:1808.02375},
  year   = {2018}
}

Comments

arXiv admin note: text overlap with arXiv:1805.08461

R2 v1 2026-06-23T03:26:50.418Z