Structure connectivity and substructure connectivity of twisted hypercubes

Abstract: Let

G

be a graph and

T

a certain connected subgraph of

G

. The

T

-structure connectivity

k a p p a (G; T)

(or resp.,

T

-substructure connectivity

k a p p a^{s} (G; T)

) of

G

is the minimum number of a set of subgraphs

m a t h c a l F = T_{1}, T_{2}, l d o t s, T_{m}

(or resp.,

m a t h c a l F = T_{1}^{'}, T_{2}^{'}, l d o t s, T_{m}^{'}

) such that

T_{i}

is isomorphic to

T

(or resp.,

T_{i}^{'}

is a connected subgraph of

T

) for every

1 l e q i l e q m

, and

m a t h c a l F

's removal will disconnect

G

. The twisted hypercube

H_{n}

is a new variant of hypercubes with asymptotically optimal diameter introduced by X.D. Zhu. In this paper, we will determine both

k a p p a (H_{n}; T)

and

k a p p a^{s} (H_{n}; T)

for

T i n K_{1, r}, P_{k}

, respectively, where

3 l e q r l e q 4

and

1 l e q k l e q n

.

Recommendations

Cites Work

Cited In (20)

This page was built for publication: Structure connectivity and substructure connectivity of twisted hypercubes