In:
The Computer Journal, Oxford University Press (OUP), Vol. 65, No. 12 ( 2022-12-30), p. 3156-3166
Abstract:
As a generalization of vertex connectivity, for connected graphs $G$ and $T$, the $T$-structure connectivity $\kappa (G; T)$ (resp. $T$-substructure connectivity $\kappa ^{s}(G; T)$) of $G$ is the minimum cardinality of a set of subgraphs $F$ of $G$ that each is isomorphic to $T$ (resp. to a connected subgraph of $T$) so that $G-F$ is disconnected. For $n$-dimensional hypercube $Q_{n}$, Lin et al. showed $\kappa (Q_{n};K_{1,1})=\kappa ^{s}(Q_{n};K_{1,1})=n-1$ and $\kappa (Q_{n};K_{1,r})=\kappa ^{s}(Q_{n};K_{1,r})=\lceil \frac{n}{2}\rceil $ for $2\leq r\leq 3$ and $n\geq 3$ (Lin, C.-K., Zhang, L.-L., Fan, J.-X. and Wang, D.-J. (2016) Structure connectivity and substructure connectivity of hypercubes. Theor. Comput. Sci., 634, 97–107). Sabir et al. obtained that $\kappa (Q_{n};K_{1,4})=\kappa ^{s}(Q_{n};K_{1,4})= \lceil \frac{n}{2}\rceil $ for $n\geq 6$ and for $n$-dimensional folded hypercube $FQ_{n}$, $\kappa (FQ_{n};K_{1,1})=\kappa ^{s}(FQ_{n};K_{1,1})=n$, $\kappa (FQ_{n};K_{1,r})=\kappa ^{s}(FQ_{n};K_{1,r})= \lceil \frac{n+1}{2}\rceil $ with $2\leq r\leq 3$ and $n\geq 7$ (Sabir, E. and Meng, J.(2018) Structure fault tolerance of hypercubes and folded hypercubes. Theor. Comput. Sci., 711, 44–55). They proposed an open problem of determining $K_{1,r}$-structure connectivity of $Q_n$ and $FQ_n$ for general $r$. In this paper, we obtain that for each integer $r\geq 2$, $\kappa (Q_{n};K_{1,r})$ $=\kappa ^{s}(Q_{n};K_{1,r})$ $=\lceil \frac{n}{2}\rceil $ and $\kappa (FQ_{n};K_{1,r})=\kappa ^{s}(FQ_{n};K_{1,r})= \lceil \frac{n+1}{2}\rceil $ for all integers $n$ larger than $r$ in quare scale. For $4\leq r\leq 6$, we separately confirm the above result holds for $Q_n$ in the remaining cases.
Type of Medium:
Online Resource
ISSN:
0010-4620
,
1460-2067
DOI:
10.1093/comjnl/bxab133
Language:
English
Publisher:
Oxford University Press (OUP)
Publication Date:
2022
detail.hit.zdb_id:
1477172-X
Permalink
