The generalized 3-connectivity of the folded hypercube FQ_n

Abstract: The generalized

k

-connectivity of a graph

G

, denoted by

k a p p a_{k} (G)

, is a generalization of the traditional connectivity. It is well known that the generalized

k

-connectivity is an important indicator for measuring the fault tolerance and reliability of interconnection networks. The

n

-dimensional folded hypercube

F Q_{n}

is obtained from the

n

-dimensional hypercube

Q_{n}

by adding an edge between any pair of vertices with complementary addresses. In this paper, we show that

k a p p a_{3} (F Q_{n}) = n

for

n g e 2

, that is, for any three vertices in

F Q_{n}

, there exist

n

internally disjoint trees connecting them.

This page was built for publication: The generalized 3-connectivity of the folded hypercube $FQ_n$