English

P_k and C_k structure and substructure connectivity of hypercubes

Combinatorics 2020-06-17 v2

Abstract

Hypercube is one of the most important networks to interconnect processors in multiprocessor computer systems. Different kinds of connectivities are important parameters to measure the fault tolerability of networks. Lin et al.\cite{LinStructure} introduced the concept of HH-structure connectivity κ(Qn;H)\kappa(Q_n;H) (resp. HH-substructure connectivity κs(Qn;H)\kappa^s(Q_n;H)) as the minimum cardinality of F={H1,,Hm}F=\{H_1,\dots,H_m\} such that Hi(i=1,,m)H_i (i=1,\dots,m) is isomorphic to HH (resp. F={H1,,Hm}F=\{H'_1,\dots,H'_m\} such that Hi(i=1,,m)H'_i (i=1,\dots,m) is isomorphic to connected subgraphs of HH) such that QnV(F)Q_n-V(F) is disconnected or trivial. In this paper, we discuss κ(Qn;H)\kappa(Q_n;H) and κs(Qn;H)\kappa^s(Q_n;H) for hypercubes QnQ_n with n3n\geq 3 and H{Pk,Ck3k2n1}H\in \{P_k,C_k|3\leq k\leq 2^{n-1}\}. As a by-product, we solve the problem mentioned in \cite{ManeStructure}.

Cite

@article{arxiv.2002.10134,
  title  = {P_k and C_k structure and substructure connectivity of hypercubes},
  author = {Yihan Chen and Bicheng Zhang},
  journal= {arXiv preprint arXiv:2002.10134},
  year   = {2020}
}

Comments

15 pages, 9 figures

R2 v1 2026-06-23T13:51:21.137Z