English

The star-structure connectivity and star-substructure connectivity of hypercubes and folded hypercubes

Combinatorics 2022-11-23 v1 Information Theory math.IT

Abstract

As a generalization of vertex connectivity, for connected graphs GG and TT, the TT-structure connectivity κ(G,T)\kappa(G, T) (resp. TT-substructure connectivity κs(G,T)\kappa^{s}(G, T)) of GG is the minimum cardinality of a set of subgraphs FF of GG that each is isomorphic to TT (resp. to a connected subgraph of TT) so that GFG-F is disconnected. For nn-dimensional hypercube QnQ_{n}, Lin et al. [6] showed κ(Qn,K1,1)=κs(Qn,K1,1)=n1\kappa(Q_{n},K_{1,1})=\kappa^{s}(Q_{n},K_{1,1})=n-1 and κ(Qn,K1,r)=κs(Qn,K1,r)=n2\kappa(Q_{n},K_{1,r})=\kappa^{s}(Q_{n},K_{1,r})=\lceil\frac{n}{2}\rceil for 2r32\leq r\leq 3 and n3n\geq 3. Sabir et al. [11] obtained that κ(Qn,K1,4)=κs(Qn,K1,4)=n2\kappa(Q_{n},K_{1,4})=\kappa^{s}(Q_{n},K_{1,4})=\lceil\frac{n}{2}\rceil for n6n\geq 6, and for nn-dimensional folded hypercube FQnFQ_{n}, κ(FQn,K1,1)=κs(FQn,K1,1)=n\kappa(FQ_{n},K_{1,1})=\kappa^{s}(FQ_{n},K_{1,1})=n, κ(FQn,K1,r)=κs(FQn,K1,r)=n+12\kappa(FQ_{n},K_{1,r})=\kappa^{s}(FQ_{n},K_{1,r})=\lceil\frac{n+1}{2}\rceil with 2r32\leq r\leq 3 and n7n\geq 7. They proposed an open problem of determining K1,rK_{1,r}-structure connectivity of QnQ_n and FQnFQ_n for general rr. In this paper, we obtain that for each integer r2r\geq 2, κ(Qn;K1,r)=κs(Qn;K1,r)=n2\kappa(Q_{n};K_{1,r})=\kappa^{s}(Q_{n};K_{1,r})=\lceil\frac{n}{2}\rceil and κ(FQn;K1,r)=κs(FQn;K1,r)=n+12\kappa(FQ_{n};K_{1,r})=\kappa^{s}(FQ_{n};K_{1,r})= \lceil\frac{n+1}{2}\rceil for all integers nn larger than rr in quare scale. For 4r64\leq r\leq 6, we separately confirm the above result holds for QnQ_n in the remaining cases.

Keywords

Cite

@article{arxiv.2009.13751,
  title  = {The star-structure connectivity and star-substructure connectivity of hypercubes and folded hypercubes},
  author = {Lina Ba and Heping Zhang},
  journal= {arXiv preprint arXiv:2009.13751},
  year   = {2022}
}
R2 v1 2026-06-23T18:52:01.202Z