Wide diameters and Rabin numbers of

generalized folded hypercube networks

94

Wide Diameters and Rabin Numbers of

Generalized Folded Hypercube Networks

Student: Pei-Shan Lan

Advisor: Sheng-Chyang Liaw

A Thesis
Submitted to Department of Mathematics
College of Science
National Central University
in Partial Fulfillment of the Requirements
for the Degree of Master
in
Mathematics
June 2005
Jhongli, Taiwan, Republic of China

(93 5 )

/()
( V ) ()
(

) ()

) ()

:
:

Wide diameters and Rabin numbers of generalized folded

hypercube networks

92221001

94

15

1.

2.

3.

 Wide diameters and Rabin numbers of generalized

folded hypercube networks

---dw(G)

---Dw(G)

---rw(G)---r*w(G)

k
d(G)dk(G)Dk(G)rk(G)r*k(G)

Abstract
Reliability, efficiency, security, and broadcasting are important criteria in the
design of interconnection networks.

Recently, the w-wide diameter dw (G), the

(w 1)-fault diameter Dw (G), and the w-Rabin number rw (G) have been used
to determine reliability and efficiency of interconnection networks. In this thesis,
we study d(G), dk (G), Dk (G), rk (G), and rk (G) of generalized folded hypercube networks having connectivity k.

ii

Contents
Abstract (in English)

ii

Contents

iii

1 Introduction

2 Diameter of Generalized Folded Hypercube networks

3 dk (G) and Dk (G) of Generalized Folded Hypercube networks

3.1

An upper bound of dk (G) . . . . . . . . . . . . . . . . . . . . . . . .

3.2

An lower bound of Dk (G) . . . . . . . . . . . . . . . . . . . . . . . . 16

4 rk (G) and rk (G) of Generalized Folded Hypercube networks

18

References

21

iii

Introduction
Reliability, efficiency, security, and broadcasting are important criteria in the

design of interconnection networks. Connectivity is widely used to measure network

fault-tolerance capacity, while diameter determines routing efficiency along individual paths. By discussing fault-diameter could raise efficiency of network transmission. Wide diameter and Rabin number determine security and broadcasting of
networks.
By a network we mean a graph without loops or multiple edges. The distance
dG (x, y) from a vertex x to another vertex y in a network G is the minimum number
of edges of a path from x to y, while G is a graph with vertex V (G) and edge set
E(G). The diameter d(G) of G is defined as the maximum value of dG (x, y) over
all x, y in V (G). For x, y in V (G), if xy in E(G), then let G xy denote the graph
obtained from G by deleting the edge xy; otherwise we mean G xy = G.
Let P = v0 v1 v2 vp be a path of G. We denote the length of P by l(P ) =
|E(P )|. And we denote the set of internal vertices of P by int(P ), that is, int(P )=
V (P ) {v0 , vp }. Two paths P and Q are said to be internally vertex-disjoint if
int(P ) V (Q) = and int(Q) V (P ) = . Throughout this thesis, vertex-disjoint
always means internally vertex-disjoint. Given another path R = vp vp+1 vr in
G, we denote the sequence of vertices v0 v1 vp vp+1 vq by P R. Note that P R
may not be an elementary path in G.
Let G be a graph. The (open) neighborhood of a vertex v is the set NG (v)
consisting of all vertices adjacent to v, i.e. NG (v) = {u V (G)|uv E(G)}. The
closed neighborhood of v is the set NG [v] = VG (v) {v}. Let P = v0 v1 v2 vp be a
path of G. For vi , vj V (P ) (i < j), let P [vi , vj ] denote the subpath from vi to vj
in P , i.e. P [vi , vj ] = vi vi+1 vj .
The connectivity (G) of a graph G is the minimum number of vertices whose
1

removal results in a disconnected or trivial graph. We say that G is k-connected if

(G) k. According to the Mengers theorem, there exist k vertex-disjoint paths
from a vertex x to another vertex y in a graph of connectivity k.
The w-wide diameter dw (G) of a graph G is the minimum l such that for any
two distinct vertices x and y there exist w vertex-disjoint paths of length at most l
from x to y. The notion of w-wide diameter was introduced by Hsu [3] to unify the
concepts of diameter and connectivity.
The (w 1)-fault diameter of G is Dw (G)=max{d(G S) : |S| w 1}. This
notion was defined by Hsu [3], and the special case in which w = k(G) was first
defined by Krishnamoorthy and Krishnamurthy [5] who studied the fault-tolerant
properties of graphs and networks.
The w-Rabin number rw (G) of a graph G is the minimum l such that for any
w + 1 distinct vertices x, y1 , y2 , , yw there exist w vertex-disjoint paths of length
at most l from x to y1 , y2 , , yw . This concept was first defined by Hsu [3] and
the special case in which w = k(G) was studied by Rabin [9] in conjunction with a
randomized routing algorithm.
It is clear that when w = 1, d1 (G) = D1 (G) = r1 (G) = d(G) for any graph G.
And the following are basic properties and relationships among dw (G), Dw (G), and
rw (G).
Proposition 1.1 [8] The following statements hold for any graph G of connectivity
k.
(1) D1 (G) D2 (G) Dk (G).
(2) d1 (G) d2 (G) dk (G).
(3) r1 (G) r2 (G) rk (G).
(4) Dw (G) dw (G) and Dw (G) rw (G) for 1 w k.
The strong w-Rabin number rw (G) of a graph G is the minimum l such that
2

for any w + 1 (not necessarily distinct) vertices x, y1 , y2 , , yw , there exist w vertexdisjoint paths of length at most l from x to y1 , y2 , , yw . This concept was first
defined by Liaw and Chang [7]. Clearly, we have the following.
Proposition 1.2 [7] The following statements hold for any network G of connectivity k.
(1) r1 (G) r2 (G) rk (G).
(2) dw (G) rw (G) and rw (G) rw (G) for 1 w k.
A generalized folded hypercube network GFn (b) is a graph whose vertices are
b-ary sequences x = (x1 , x2 , , xn ) with 0 xi b 1 for 1 i n, b 2,
and x adjacent to other vertices differ by exactly one coordinate and (x1 + m, x2 +
m, , xn + m) for 1 m b 1 where operations are taken modulo b. From the
definition of GFn (b), we have the fact that each vertex has degree (b 1)n + (b 1).
In section 3, we will show that the connectivity (GFn (b)) is the degree of GFn (b).
This graph was one of OGn (b) which first defined by Lakshmivarahan, Jwo, and
Dhall [6]. Note that GFn (b) is vertex-transitive.
If b = 2, denote GFn (2) by F H(n), was defined by El-Amawy and Latifi [2].
El-Amawy and Latifi [2] showed that the diameter d(F H(n)) = d n2 e; Duh et al. [1]
obtained that dn+1 (F H(n)) = d n2 e + 1 for n 2. Furthermore, Liaw and Chang [7]
proved the following proposition.
Proposition 1.3 [7] If n 2, then

Dw (F H(n)) = dw (F H(n)) =

d 2 e,

for 1 w d n2 e 1,

d n e + 1,
2

for d n2 e w n + 1.

Moreover, T. Kojima [4] proved the following proposition.

Proposition 1.4 [4] If n 2, then

rw (F H(n)) =

rw (F H(n))

d 2 e,

for 1 w d n2 e 1,

d n e + 1,
2

for d n2 e w n + 1.

In this thesis, we study diameter, k-wide diameter, (k 1)-fault diameter,

k-Rabin number and strong k-Rabin number for generalized folded hypercube networks with k = (GFn (b)) = (b 1)n + (b 1). Determining the exact values of
d(GFn (b)), dk (GFn (b)), Dk (GFn (b)), rk (GFn (b)) and rk (GFn (b)).

Diameter of Generalized Folded Hypercube networks

For any ~x in V (GFn (b)), let ~x = (x1 , x2 , , xn ) with 0 xi b 1 for

1 i n, b 2. Let em,i = (0, , 0, m, 0, , 0), where xi = m, xj = 0 for all

j 6= i; em,n+1 = (m, , m). So, if there is an edge ~x~y in E(GFn (b)) then ~y = ~x +em,i
for some 1 m b 1, i = 1, 2, , n + 1, where the addition is the general vector
addition by taking modulo b in each coordinate of the vector. That is, we can use
~x ~x + e1 ~x + e1 + e2 ~x +

d
X

el = ~y , where el = em,i for some

l=1

1 m b 1, i = 1, 2, , n + 1, to represent a path P from ~x to ~y . Moreover, the

sequence hhe1 , e2 , , ed ii is called the edge sequence of the path P .
Lemma 2.1 For any ~x, ~y in V (GFn (b)), if d(~x, ~y ) = d, then we must have a shortest
path P : ~x ~x + e1 ~x + e1 + e2 ~x +

d
X

el = ~y , where el = em,i for some

l=1

1 m b 1, i = 1, , n + 1, such that any two of el will not be the same, i.e.

e 6= e for all 6= . Moreover, if e = em1 ,i1 , e = em2 ,i2 , then i1 6= i2 .
Proof. If e = e = em,i for some 1 < d, then
e + e = 2em,i = e2m,i = em0 ,i ,

where 2m m0 (mod b).

So, we can find a path P 0 shorter than P by deleting e , e and adding em0 ,i from the
edge sequence of the path P , it is a contradiction. Hence e 6= e for all 1 , d,
6= .
If e = em1 ,i , e = em2 ,i for some 1 < d and m1 6= m2 , then
e + e = em1 ,i + em2 ,i = em1 +m2 ,i = em0 ,i , where m1 + m2 m0 (mod b). So we
can find a path P 0 shorter than P by deleting e , e and adding em0 ,i from the edge
sequence of the path P , it is a contradiction. Hence i1 6= i2 for all 1 i1 , i2 n + 1.

The following lemma is a trivial observation.

Lemma 2.2 Let P : ~x ~x + e1 ~x + e1 + e2 ~x +

d
X

el = ~y be a

l=1

path from ~x to ~y . If we change the order of those el and denote them by e0l , then
P 0 : ~x ~x + e01 ~x + e01 + e02 ~x +

d
X

e0l = ~y is also a path from ~x to ~y .

l=1

Theorem 2.3 d(GFn (b)) = d (b1)n

e, for all n.
b
Proof. Because GFn (b) is vertex transitive, we can suppose that d(GFn (b))=
max{d(~0, ~x) | ~0 = (0, , 0), ~x V (GFn (b))}. We first show that d(GFn (b))
d (b1)n
e, for all n. For any ~x V (GFn (b)), without loss of generality, we may
b
assume that ~x = (x1 , x2 , , xn ) and

0,

1,

xi = 2,

..

b 1,

if 1 i r0 ;
if r0 + 1 i r0 + r1 ;
if r0 + r1 + 1 i r0 + r1 + r2 ;

if r0 + r1 + + rb2 + 1 i r0 + r1 + + rb1 = n.

Case1. r0 d nb e. Then we have the following path:

~0 e1,r0 +1 e1,r0 +1 + e1,r0 +2

r0X
+r1
i=r0 +1
r0X
+r1
i=r0 +1

b1
X
j=1

e1,i
e1,i +

r0X
+r1

e1,i + e2,r0 +r1 +1

i=r0 +1
r0 +r
1 +r2
X

e2,l

l=r0 +r1 +1
r0 ++rj

ej,q = ~x.

q=r0 ++rj1 +1

Hence d(~0, ~x) n r0 n d nb e = b (b1)n

c d (b1)n
e.
b
b
Case2. r0 < d nb e. So, r1 + + rb1 = n r0 > n d nb e = b (b1)n
c. By the
b
Pigeonhole Principle, ri b nb c+1 for some 1 i b1. Without loss of generality,
say r1 b nb c + 1, then we have the following path:
6

~0 e1,n+1 e1,n+1 + eb1,1

e1,n+1 +
e1,n+1 +
e1,n+1 +

r0
X
i=1
r0
X
i=1
r0
X

eb1,i
eb1,i + e1,r0 +r1 +1
e1,l
l=r0 +r1 +1
r0 ++rj+1
b2

eb1,i +

j=1

q=r0 ++rj +1

i=1

e1,n+1 +

r0
X

r0 +r
1 +r2
X

eb1,i +

i=1

ej,q = ~x.

Then d(~0, ~x) 1+ro +r2 + +rb1 = 1+nr1 1+n(b nb c+1) = d (b1)n
e.
b
e.
By Case1 and Case2, d(GFn (b)) d (b1)n
b
Now we consider the other side. Given ~x V (GFn (b)), ~x = (x1 , x2 , , xn ),
and

xi =

0,

1,

if 1 i r0 ;
if r0 + 1 i r0 + r1 ;
if r0 + r1 + 1 i r0 + r1 + r2 ;

2,

..

b 1,

if r0 + r1 + + rb2 + 1 i r0 + r1 + + rb1 = n.

Suppose d(~0, ~x) = d, then we must have a shortest path P : ~0 e1

e1 + e2

d
X

el = ~x, where el = em,i , for some 1 m b 1, i = 1, , n + 1.

l=1

In the case of n = bh, h N. Choose ~x V (GFn (b)) such that r0 = r1 =

= rb1 = h. If el = ej,n+1 , for some 1 l d, 1 j b 1, then we can change
the order of those el , such that e01 = ej,n+1 . By Lemma 2.1, we have e0l 6= ei,n+1 ,
for all 2 l d, 1 i b 1. Then d(e01 , ~x)=n(number of j)=(b 1)h= (b1)n
.
b
And d(~0, ~x) =

(b1)n
b

+ 1 > d (b1)n
e, a contradiction. Hence el 6= ej,n+1 , for all
b

1 l d, 1 j b 1. Then el = em,i , for all 1 l d, i 6= n + 1, and we obtain

e(=(number of 1)+(number of 2)+ +(number of (b1))=(b1)h).

d(~0, ~x) = d (b1)n
b
Hence d(GFn (b)) d (b1)n
e, for n = bh, h N.
b
In the case of n = bh + c, h N {0}, 1 c b 1. Choose ~x V (GFn (b))
such that r1 = r2 = = rc = h + 1 and r0 = rc+1 = rc+2 = = rb1 = h.
If el = ej,n+1 , for some 1 l d, c + 1 j b 1, then we can change
the order, such that e01 = ej,n+1 . By Lemma 2.1, we have e0l 6= ei,n+1 , for all
2 l d, 1 i b 1. Then d(e01 , ~x)=n(number of j)=(b 1)h + c. And
d(~0, ~x) = (b 1)h + c + 1 > d (b1)n
e, a contradiction. Hence el 6= ej,n+1 , for all
b
1 l d, c + 1 j b 1. If el = ej,n+1 , for some 1 l d, 1 j c, then we
can change the order, such that e01 = ej,n+1 . By Lemma 2.1, we have e0l 6= ei,n+1 , for
all 2 l d, 1 i b 1. Then d(e01 , ~x)=n(number of j)=(b 1)h + (c 1). And
e. If el 6= ej,n+1 , for all 1 l d, 1 j b 1, then
d(~0, ~x) = (b 1)h + c d (b1)n
b
e.
el = em,i , for some 1 m b1, 1 i n. Hence d(~0, ~x) = (b1)h+c d (b1)n
b
And we obtain d(GFn (b)) d (b1)n
e, for n = bh + c, h N {0}, 1 c b 1.
b
From the two cases above, we obtain d(GFn (b)) d (b1)n
e, for all n.
b
e, for all n.
Hence d(GFn (b)) = d (b1)n
b

dk (G) and Dk (G) of Generalized Folded Hypercube networks

3.1

An upper bound of dk (G)

r
X

We denote by hhe1 , e2 , , er ii the following path from 0 to

el , where
l=1

additions are performed modulo b:

r

0 e1 e1 + e2
el .
l=1

From the following proof of Theorem 3.1, we can find as many as degree
of GFn (b) vertex-disjoint paths, then (GFn (b)) is the degree of GFn (b), that is
(b 1)n + (b 1).
Theorem 3.1 For n 1, dk (GFn (b)) d (b1)n
e + 1.
b
Proof. We claim that between any two vertices in GFn (b), there exist (b 1)n +
(b 1) vertex-disjoint paths of length at most d (b1)n
e + 1. Since the graph is
b
vertex-transitive, it suffices to prove the claim for vertices ~0 = (0, 0, , 0) and
~x = (x1 , x2 , , xn ) with

0,

1,

xi = 2,

..

b 1,

if 1 i r0 ;
if r0 + 1 i r0 + r1 ;
if r0 + r1 + 1 i r0 + r1 + r2 ;

if r0 + r1 + + rb2 + 1 i r0 + r1 + + rb1 = n.

Case1. If r0 = r1 = = rb1 = h, that is n = bh, then choose the following

paths:
t(j1)n+jh+i : hh ej,jh+i , ej,jh+i+1 , , ej,(j+1)h , e(j+1),(j+1)h+1 , , e(b1),bh ,
e1,h+1 , , ej,jh+i1
9

ii for 1 i h, 1 j b 1,

e;
having l(t(j1)n+jh+i ) = (b 1)h = d (b1)n
b
t(j1)n+ah+i : hh ej,ah+i , ej,ah+(i+1) , , ej,(a+1)h , ej+1,(a+1)h+1 , ,
eb1,(bj+a)h , e1,(bj+a+1)h+1 , ,
ej+(b1)a,(b1)h+1 , , ej+(b1)a,bh ,
ebj+a,n+1 , ej+ba,1 , , ej1,ah ,
ej,ah+1 , , ej,ah+i1

ii for 1 j b 1,

1 i h, 0 a b 1, a 6= j,
hh ej,ah+i , ej,ah+(i+1) , , ej,(a+1)h , ej+1,(a+1)h+1 , ,
eb1,(b1)h , eb1,n+1 , e1,1 , , ej1,ah ,
ej,ah+1 , , ej,ah+i1

ii for 1 a + 1 = j b 1, 1 i h,

and
hh ej,ah+i , ej,ah+(i+1) , , ej,(a+1)h , ej+1,(a+1)h+1 ,
ej+(b1)a,(b1)h+1 , , ej+(b1)a,bh , ebj+a,n+1 ,
ej+ba,1 , , eb1,(bj+a)h , e1,(bj+a+1)h+1 , ,
ej1,ah , ej,ah+1 , , ej,ah+i1

ii for 1 j < a b 1, 1 i h,

having l(t(j1)n+ah+i ) = (b 1)h + 1 = d (b1)n

e + 1;
b
t(b1)n+j : hh ej,n+1 , ebj,1 , , ebj,h , ebj+1,h+1 , ,
eb1,jh , e1,(j+1)h+1 , , eb1j,bh

ii for 1 j b 1,

e + 1.
having l(t(b1)n+j ) = (b 1)h + 1 = d (b1)n
b
Case2. If r0 is the largest one, say r0 > b nb c, then r1 + + rb1 = n r0 <
d (b1)n
e. We can choose the following paths:
b
t(j1)n+i : hhej,i , e1,r0 +1 , , eb1,r0 ++rb1 , ebj,i ii for 1 i r0 , 1 j b 1,
10

e + 1;
having l(t(j1)n+i ) = r1 + + rb1 + 2 d (b1)n
b
t(j1)n+(r0 +r1 ++rj1 )+i : hh ej,(r0 ++rj1 )+i , ej,(r0 ++rj1 )+i+1 , ,
ej,r0 ++rj1 +rj , ej+1,r0 ++rj +1 , ,
eb1,(r0 ++rb2 )+1 , , eb1,r0 ++rb2 +rb1 ,
e1,r0 +1 , , e1,r0 +r1 , e2,r0 +r1 +1 , ,
ej,(r0 ++rj1 )+i1

ii for 1 i rj , 1 j b 1,

e;
having l(t(j1)n+(r0 +r1 ++rj1 )+i ) = r1 + + rb1 < d (b1)n
b
t(b1)n+j : hh ej,n+1 , ej,r0 ++rj1 +1 , , eb1,r0 ++rb1 , e1,r0 +1 , ,
ej1,r0 ++rj1 , ebj,n+1

ii for 1 j b 1,

e + 1;
having l(t(b1)n+j ) = r1 + + rb1 + 2 d (b1)n
b
t(j1)n+(r0 ++ra1 )+i : hh ej,(r0 ++ra1 )+i , ea,(r0 ++ra1 )+i+1 , ,
ea,r0 ++ra , ea+1,(r0 ++ra )+1 , ,
eb1,r0 ++rb1 , e1,r0 +1 , ,
ea,(r0 ++ra1 )+i1 , ebj+a,(r0 ++ra1 )+i

ii

for 1 i ra , 1 j b1, 1 a b1, and a 6= j, having l(t(j1)n+(r0 ++ra1 )+i ) =

r1 + + rb1 + 1 d (b1)n
e.
b
Case3. If r1 is the largest one, say r1 > b nb c, then r0 + r2 + + rb1 =
n r1 < d (b1)n
e. We can choose the following (b 1)n + (b 1) paths tp , 1 p
b
(b 1)n + (b 1):
For p = (j 1)n + i, 1 i r0 , 1 j b 1,
t(j1)n+i : hh ej,i , eb1,i+1 , , eb1,r0 , e1,r0 +r1 +1 , , eb2,r0 ++rb1 , eb1,1 , ,
eb1,i1 , e1,n+1 , ebj1,i

ii,
11

e + 1.
having l(t(j1)n+i ) = r0 + r2 + + rb1 + 2 d (b1)n
b
For p = r0 + i, 1 i r1 , we divide paths into two subcases:
Subcase1, if r1 b nb c + 2, then r0 + r2 + + rb1 d (b1)n
e 2. We can
b
choose the following paths:
tr0 +i : hh e1,r0 +i , eb1,1 , , eb1,r0 , e1,r0 +r1 +1 , ,
eb2,r0 ++rb1 , e1,n+1 , eb1,r0 +i

ii,

having l(tr0 +i ) = r0 + r2 + + rb1 + 3 d (b1)n

e + 1.
b
Subcase2, if r1 = b nb c + 1, then r0 + r2 + + rb1 = d (b1)n
e 1, r0 < b nb c + 1
b
(If r0 = b nb c + 1, use Case 2), and rj b nb c + 1 for 2 j b 1. We can choose
the following paths:
tr0 +i : hh e1,r0 +i , , e1,r0 +r1 , e2,r0 +r1 +1 , , eb1,r0 ++rb1 , e1,r0 +1 , , e1,r0 +i1

ii

if rj < b nb c+1, 2 j b1, having l(tr0 +i ) = r1 + +rb1 b nb c+1+(b2)b nb c

e + 1;
d (b1)n
b
and
tr0 +i : hh e1,r0 +i , ebj+1,r0 +i+1 , , ebj+1,r0 +r1 , ebj+2,r0 +r1 +1 , ,
eb1,r0 ++rj1 , e1,(r0 ++rj )+1 , , ebj1,r0 ++rb1 , ej,n+1 , ebj,r0 +i

ii

e + 1.
if rj = b nb c + 1 for some j, having l(tr0 +i ) = n rj + 2 = d (b1)n
b
For p = (j 1)n + r0 + i, 1 i r1 , 2 j b 1, we divide paths into two
subcases:
Subcase1, if r1 b nb c + 2, then r0 + r2 + + rb1 d (b1)n
e 2. We can
n
choose the following paths:
t(j1)n+r0 +i : hh ej,r0 +i , eb1,1 , , eb1,r0 , e1,r0 +r1 +1 , ,
eb2,r0 ++rb1 , e1,n+1 , ebj,r0 +i
12

ii,

e + 1.
having l(t(j1)n+r0 +i ) = r0 + r2 + + rb1 + 3 d (b1)n
b
Subcase2, if r1 = b nb c + 1, then r0 + r2 + + rb1 = d (b1)n
e 1, r0 < b nb c + 1
b
(If r0 = b nb c + 1, use Case 2), and rj b nb c + 1 for 2 j b 1.
If rs = b nb c + 1 for some s, we can choose the following paths:
t(j1)n+r0 +i : hh ej,r0 +i , ebs+1,r0 +i+1 , , ebs+1,r0 +r1 , ebs+2,r0 +r1 +1 , ,
eb1,r0 ++rs1 , e1,(r0 ++rs )+1 , , ebs1,r0 ++rb1 , ebs,1 , ,
ii,

ebs+1,r0 +i1 , es,n+1 , ebjs+1,r0 +i

having l(t(j1)n+r0 +i ) = n rs + 2 = d (b1)n
e + 1.
b

If rs < b nb c + 1 for all s 2, then there is at most one rp = b nb c 1 for some

2 p b 1 or p = 0, and the others are rq = b nb c for q 6= p. We can choose the
following paths by discussing rs .
(a.) If rs = b nb c for all 2 s b 1 and s = 0, or r0 = b nb c 1, and rs = b nb c
for all 2 s b 1, there must exists some u, 1 u b 1, such that j + u 1
(mod b). We choose:
t(j1)n+r0 +i : hh ej,r0 +i , ej,r0 +i+1 , , ej,r0 +r1 , ej+1,r0 +r1 +1 , ,
eb1,r0 ++ru1 , e1,(r0 ++ru )+1 , , eb1u,r0 ++rb1 ,
eu,n+1 , ebu,1 , , ej,r0 +i1

ii,

e + 1.
having l(t(j1)n+r0 +i ) = n ru + 1 = d (b1)n
b
(b.) If rq = b nb c 1 for some 2 q b 1, and r0 = rs = b nb c for s 6= q,
2 s b 1. We choose:
t(j1)n+r0 +i : hh ej,r0 +i , e1,r0 +i+1 , , e1,r0 +r1 , e2,r0 +r1 +1 , ,
eb1,r0 ++rb1 , e1,r0 +1 , , e1,r0 +i1 , eb+1j,r0 +i
having l(t(j1)n+r0 +i ) = n r0 + 1 = d (b1)n
e + 1.
b
13

ii,

The remaining paths are the following paths:

t(j1)n+(r0 ++rj1 )+i : hh e1,(r0 ++rj1 )+i , ej1,(r0 ++rj1 )+i+1 , ,
ej1,r0 ++rj , ej,(r0 ++rj )+1 , ,
eb2,r0 ++rb1 , eb1,1 , , eb1,r0 , e2,r0 +r1 +1 , ,
ej1,(r0 ++rj1 )+i1 , e1,n+1 , ej2,(r0 ++rj1 )+i

ii

for 1 i rj , 2 j b1, having l(t(j1)n+(r0 ++rj1 )+i ) = r0 +r2 + +rb1 +2

e + 1;
d (b1)n
b
t(j1)n+(r0 ++ra1 )+i : hh ej,(r0 ++ra1 )+i , ea1,(r0 ++ra1 )+i+1 , ,
ea1,ro ++ra , ea,(r0 ++ra )+1 , ,
eb2,r0 ++rb1 , eb1,1 , , eb1,r0 , e2,r0 +r1 +1 , ,
ea1,(r0 ++ra1 )+i1 , e1,n+1 , ea1j,(r0 ++ra1 )+i

ii

for 2 a b1, 2 j b1, a 6= j and 1 i ra , having l(t(j1)n+(r0 ++ra1 )+i ) =

r0 + r2 + + rb1 + 2 d (b1)n
e + 1;
b
t(b1)n+1 : hhe1,n+1 , e1,r0 +r1 +1 , , eb2,r0 ++rb1 , eb1,1 , , eb1,r0

ii,

e;
having l(r(b1)n+1 ) = r0 + r2 + + rb1 + 1 d (b1)n
b
t(b1)n+j : hh ej,n+1 , e1,r0 +r1 +1 , , eb2,r0 ++rb1 ,
eb1,1 , , eb1,r0 , ebj+1,n+1

ii for 2 j b 1,

having l(t(b1)n+j ) = r0 + r2 + + rb1 + 2 d (b1)n

e + 1.
b
If rs (s 2) is the largest one, then the argument is similar to the Case 3.
Hence dk (GFn (b)) d (b1)n
e+1, where k = (b1)n+(b1) is the connectivity
b
(G).

14

Note that from the above process we have k(= (b 1)n + (b 1)) vertexdisjoint paths, say Q1 , Q2 , , Qk , from x to y for any two distinct vertices x, y in
V (GFn (b)). Each path, Qj , is either l(Qj ) 2 or Qj [x, zj ] is one of the shortest
(x, zj )-path in GFn (b) NG [y], where zj is the vertex of Qj with l(Qj [zj , y]) = 2.
The above observation will be useful for counting length in the proof of Lemma 4.1.

15

3.2

An lower bound of Dk (G)

e + 1.
Theorem 3.2 For n 1, Dk (GFn (b)) d (b1)n
b
Proof. For convenience, let G = GFn (b). Given ~x V (GFn (b)), ~x = (x1 , x2 , , xn ),
and

0,

1,

xi = 2,

..

b 1,

if 1 i r0 ;
if r0 + 1 i r0 + r1 ;
if r0 + r1 + 1 i r0 + r1 + r2 ;

if r0 + r1 + + rb2 + 1 i r0 + r1 + + rb1 = n.

We will divide our proof into two cases depending upon the value of n.
Case1. If n = bh, h N.
Let r0 = h + 1, r1 = h 1, and r2 = r3 = = rb1 = h. If we choose
S = {e1,i |1 i n} {ep,j |2 p b 1, 1 j n + 1}, then ~0 is only adjacent
to e1,n+1 in G S. We have dGS (e1,n+1 , ~x) = (b 1)h that implies Dk (G)
e + 1. Note that
(b 1)h + 1 = d (b1)n
b
hhe1,r0 +1 , , e1,r0 +r1 , e2,r0 +r1 +1 , , eb1,r0 ++rb1 , eb1,n+1 ii
is one of the shortest paths between e1,n+1 and ~x.
Case2. If n = bh + c, h N {0}, 1 c b 1.
Let r0 = h + 1, r1 = h, r2 = r3 = = rc = h + 1, and rc+1 = = rb1 = h.
If we choose S = {e1,i |1 i n} {ep,j |2 p b 1, 1 j n + 1}, then ~0 is
only adjacent to e1,n+1 in G S. We have dGS (e1,n+1 , ~x) = (b 1)h + c that implies
Dk (G) (b 1)h + c + 1 d (b1)n
e + 1. Note that
b
hhe1,r0 +r1 +1 , , e1,r0 +r1 +r2 , e2,r0 +r1 +r2 +1 , , eb2,r0 ++rb1 , eb1,1 , , eb1,r0 ii
is one of the shortest paths between e1,n+1 and ~x.
16

e + 1, for all n.
Hence Dk (GFn (b)) d (b1)n
b
From Proposition 1.1(4), Theorem 3.1 and 3.2, we have the following Theorem.
Theorem 3.3 For n 1,
&

'

(b 1)n
dk (GFn (b)) = Dk (GFn (b)) =
+ 1.
b

17

rk (G) and rk (G) of Generalized Folded Hyper-

cube networks
Let G be a graph, P = v0 v1 v2 vp be a path of G. An edge vi vj E(G) E(P )
(i < j) is called a chord of P in G. A path P is said to be chordless in G if P has
no chord in G. If P has some chords in G, then let i be the minimum value such
that vi vj is a chord of P in G. Then, by replacing the subpath P [vi , vj ] by an edge
vi vj , we get a new (v0 , vp )-path P 0 = v0 v1 vi vj vj+1 vp such that V (P 0 ) V (P )
and the number of chords of P 0 is less than of P . Repeating this process, we finally
get a chordless (v0 , vp )-path Q from P such that V (Q) V (P ) and l(Q) l(P ).
We call this path Q a chordless path of P in G.
e + 1.
Lemma 4.1 If n 1, then rk (GFn (b)) d (b1)n
b
Proof. Let x be a vertex of GFn (b) and let y1 , y2 , , yk (not necessarily distinct)
be vertices of GFn (b) satisfying x 6= yi for i = 1, 2, , k. Suppose that there is
only w < k vertex-disjoint path, say P1 , P2 , , Pw , such that Pi is either xyi or a
e+1 for i = 1, 2, , w. We
chordless (x, yi )-path in GFn (b)xyi with l(Pi ) d (b1)n
b
choose w vertex-disjoint paths P1 , P2 , , Pw among such paths so that

w
X

l(Pi ) is

i=1

as small as possible (if necessary, change labels in y1 , y2 , , yk ). So we may assume

that if xyi E(GFn (b)), then xyi {P1 , P2 , , Pw }. Moreover, by Theorem 3.1, we
e + 1, hence there exist k vertex-disjoint paths from x to
have dk (GFn (b)) d (b1)n
b
yw+1 with length at most d (b1)n
e + 1, say Qj for j = 1, 2, , k. By the minimality
b
of

w
X

l(Pi ), we have yw+1

/ V (Pi ) when yi 6= yw+1 for i = 1, 2, , w.

i=1

We first claim that l(Qj [x, v]) + l(Pi [v, yi ]) d (b1)n

e + 1 for every v
b
V (Pi ) V (Qj ), i = 1, 2, , w, j = 1, 2, , k. If l(Pi [v, yi ]) 1, then l(Qj [x, v]) +
l(Pi [v, yi ]) l(Qj ) d (b1)n
e + 1, since yw+1
/ V (Pi ) when yi 6= yw+1 .
b

If

l(Pi [v, yi ]) 2, then we have V (Pi [x, v]) NG [yw+1 ] = . Suppose that V (Pi [x, v])
18

NG [yw+1 ] 6= , let b V (Pi [x, v]) NG [yw+1 ] and let Pw+1 be a chordless path
of Pi [x, b] byw+1 in GFn (b) xyw+1 . Then P1 , P2 , , Pi1 , Pi+1 , , Pw , Pw+1 are
w vertex-disjoint paths from x to y1 , y2 , , yi1 , yi+1 , , yw , yw+1 and l(Pw+1 ) <
l(Pi ), a contradiction to minimize

w
X

l(Pi ). Therefore, V (Pi [x, v]) NG [yw+1 ] = .

i=1

Then by the choice of Q1 , Q2 , , Qk (from the constructive paths of Theorem

3.1), we obtain l(Qj [x, v]) l(Pi [x, v]) (Qj [x, v] is one of the shortest (x, v)-path
in GFn (b) NG [yw+1 ]), and it follows that l(Qj [x, v]) + l(Pi [v, yi ]) l(Pi [x, v]) +
l(Pi [v, yi ]) = l(Pi ) d (b1)n
e + 1. Hence l(Qj [x, v]) + l(Pi [v, yi ]) d (b1)n
e + 1 for
b
b
every v V (Pi ) V (Qj ), i = 1, 2, , w, j = 1, 2, , k.
Now, we will show the lemma by using the following path changing process.
e+1
Moreover, by the above claim, the length of each path will be at most d (b1)n
b
after the path changing process. From the assumption, Qj must adjacent to at
least one Pi for all j = 1, 2, , k. Otherwise there exist at least one j such that
P1 , P2 , , Pk and Qj are pairwise vertex-disjoint, and it is a contradiction to the
hypothesis. Because w < k, there exists a vertex u adjacent to x such that u
{

k
[

V (Qj )

w
[

V (Pi )}. Without loss of generality, we may assume u V (Q1 ). We

i=1

j=1

choose a V (Q1 ) {

w
[

V (Pi ) {x}} so that V (Q1 [x, a]) {

i=1

w
[

V (Pi ) {x}} = {a}.

i=1

We may assume a V (Q1 ) V (P1 ). Let P10 be a chordless path of Q1 [x, a]

P1 [a, y1 ] in GFn (b). Then P10 is a chordless (x, y1 )-path in GFn (b) xy1 with yw+1
/
V (P10 ) when yw+1 6= y1 . By replacing P1 by P10 , we get the new w vertex-disjoint
paths P10 , P2 , , Pw . We know that there is an edge e E(P1 [x, a]) such that
e
/

k
[

E(Qj ). If for all e E(P1 [x, a]), e

j=1

k
[

E(Qj ), we have E(P1 [x, a]) E(Qj )

j=1

for some j, since those Qj are vertex-disjoint. If j 6= 1, then a V (Q1 ) V (Qj )

is a contradiction. Hence E(P1 [x, a]) E(Q1 ), it is still a contradiction since
u
/ V (P1 ). Therefore, there is an edge e E(P1 [x, a]) such that e
/

k
[

E(Qj ). If

j=1

P10 , P2 , , Pw and Qj are w +1 vertex-disjoint paths for some j, then it is contradict

19

to the hypothesis. If P10 , P2 , , Pw and Qj are not w + 1 vertex-disjoint paths for

j = 1, 2, , k, then we can apply this path changing process decreases the value of
|

w
[

E(Pi )

i=1

k
[

E(Qj )| at least one. So after finite many this process, we obtain w+1

j=1

vertex-disjoint paths P10 , P20 , , Pw0 and Qj from x to y1 , y2 , , yw+1 , a contradiction

to the hypothesis. Thus there exist k vertex-disjoint path from x to y1 , y2 , , yk
with length at most d (b1)n
e + 1, that is rk (GFn (b)) d (b1)n
e + 1.
b
b
Proposition 1.1(4), 1.2(2), Theorem 3.2, and Lemma 4.1 lead to the following
theorem.
e + 1.
Theorem 4.2 If n 1, then rk (GFn (b)) = rk (GFn (b)) = d (b1)n
b

20

References
[1] D. R. Duh, G. H. Chen and J. F. Fang, Algorithms and properties of a new
two-level network with folded hypercubes as basic modules, IEEE Transactions
on Parallel and Distributed Systems 6 (1995), 714-723.
[2] A. El-Amawy and S. Latifi, Properties and performance of folded hypercubes,
IEEE Transactions on Parallel and Distributed Systems 2 (1991), 31-42.
[3] D. F. Hsu, On container width and length in graphs, groups, and networks, IEICE Transaction on Fundamentals of Electronics, Communications and Computer Science E77-A (1994), 668-680.
[4] T. Kojima, On Rabin numbers of graphs and digraphs, preprint.
[5] M. S. Krishnamoorthy and B. Krishnamurthy, Fault diameter of interconnection
networks, Computers and Mathematics with Applications 13 (1987), 577-582.
[6] S. Lakshmivarahan, J. S. Jwo, and S. K. Dhall, Symmetry in interconnection
networks based on Caley graphs of permutation groups, Parallel Compution 19
(1993), 361-407.
[7] S. C. Liaw and G. J. Chang, Generalized diameters and Rabin numbers of
networks, Journal of Combinatorial Optimization 4 (1999), 371-384.
[8] S. C. Liaw, G. J. Chang, F. Cao, and D. F. Hsu, Fault-tolerant routing in circulant networks and cycle prefix networks, Annals of Combimatorics 2 (1998),
165-172.
[9] M. O. Rabin, Efficient dispersal of information for security, load balancing, and
fault tolerance, J. Association for Computing Machinery 36 (1989), 335-348.

21