ABSTRACT
In recent years, a growing number of concepts have been proposed to better assess network fault tolerance, among which the generalized -connectivity has been widely used in the research of fault tolerance of interconnection networks. For connected graph
,
refers to the maximum number of internally disjoint trees in
to connect
, where
with
. The generalized
-connectivity of G
. The
-dimensional folded hypercube
, as a hypercube-like network, is obtained by adding
edges on
-dimensional hypercube
. In this paper, we discuss the generalized 4-connectivity of
and show that
for
.
Acknowledgments
The authors are very grateful to the anonymous reviewers for their valuable comments, which have provided great help to improve the quality of this paper.
Disclosure statement
The authors report there are no competing interests to declare(s).