Lemma 1

Let f = (V
0
;V
1
;V
2
) be an RDF for a graph G. If V
2
is independent, then ther
is a n independent RDF g of G s!h that "(g) # s(f).
Proof . Let G be a graph and let f = (V
0
;V
1
;V
2
) be an RDF for G such that
V
2
is independent. Let, f
1
= ( )
1 1 1 1
0 1 2
; ; f V V V
"here
1
0
V
=$(V
2
),
1
1
V
=V
1
and
1
2
V
= V
2
. If V
1
is independent then f
1
% is an independent RDF for G. So suppose
that V
1
is not independent. Let &
1

V
1
be a 'erte& s!h that
[ ]
( )
1
1
deg 1
G V
&
,
and (et ( )
2 2 2 2
0 1 2
; ; f V V V

where
2
0
V
= V
0

[ ]
( )
[ ]
( )
1 1
2
1 1 1 1
,
G V G V
$ & V V $ &
and
{ }
2
2 2 1
V V &
It is ob'ios
that
2
2
V
is independent. !f
2
1
V
is not independent, we continue the abo"e
process. So there is an integer # such that
)
f
( )
1
0 1 2
; ;
) ) )
f V V V
and
1 2
) )
V V
is
independent . Since for i $ 1, 2, ..., # %1, ( ) ( )
1
,
i i
" f " f
+

we deduce that f
)
is
a independent RDF for & with "(f
)
)# "(f).
Theorem 2 i
R
(*
+,n
) = +in ,+, n- .1.
Proof. Let / and 0 be th partite sets of *
+,n
. Firs notice that if & /, then
(0; / 1 ,&- ; ,&-) is an independent RDF for &, and so
i
R
(*
+,n
) # +in ,+, n- . 1, 'ow let
( )
0 1 2
; ; f V V V
be an independent RDF for
*
+,n
. !t is ob"ious that either
1 2 1 2
. V V / or V V 0
Further, V
2
( .. )e
deduce that the weight of f is at least +in ,+,n-.1. *hus the result follows.
Theorem 3 For an2 graph G "ith
( ) ( ) ( ) +,
R R
G G i G
Proof. Let & be a graph with ,&- . +. Suppose to the contrar/ that
, -
R
G
0
( )
R
i G
. Let f = (V
0
;V
1
;V
2
) be a R

function for &. 1/ 2orollar/ 2,
V
2
is not independent. !f G 3V
2
4 has a co3ponent containing a path 5
6
b/ 0;
and its pri"ate neighbor with respect to V
2
b/ 1, and obtain an RDF for &
with weight less than
( )
R
G
. *his contradiction leads that an/ co3ponent of
G3V
2
4 is a *
2
. Let G
1
, G
2
, ...., G
r
be the co3ponents of G3V
2
4 with
V(G
i
) = ,'
i
, '
i
- for 1# i # r.
Corollary 4 !f
( ) ( ) ,
R R
G i G <
then 4 ,&- 56.
Theorem 5 For an2 graph G of order n,
( ) ,
R
i G n
Frther, the e7a(it2
ho(ds if an on(2 if
2
( G +* *
for so+e integers +, ( "ith n = 2+ . (.
Proof. Let G be a graph of order n. !t is ob"ious that
( ) ; , -; V G
is an RDF
for G. So Le33a 1 shows that
( )
R
i G n
.
For the ne7t part, First it is ob"ious that if
2 (
G +* *
for so3e
integers +, ( with n = 2+ . (, then
, -
R
i G
$ n. Suppose that G is a graph of
order n and
( ) ,
R
i G n
. For n = 1,2 the state3ent is ob"iousl/ true. *hus
assu3e that n 8 2. )e show that G has 3a7i3u3 degree at 3ost one.
Suppose to the contar/, that ' is a "erte7 of degree at least 2. Let G
1
be the
graph obtained fro3 G b/ re3o"ing
[ ] G $ ' 1
]
. 1/ the first part of the
current theore3,
( )
1 1
, -
R
i G V G
. Let f = (V
0
;V
1
;V
2
) be an i
R
function for G
1
.
*hen
{ } ( )
1 2
0 , -; ; g V $ ' V V '
is an independent RDF for G with weight
less than n, a contradiction. *hus G has 3a7i3u3 degree at 3ost one, and
so the result follows.
Theorem 6 For an2 grpah G "ith 9 (G): 6,
( ) ( )
, - 2
, - , - +
2
R R
R G
i G G G

+
Proof. Let G be a graph with
( ) + G
. !f
( ) ( )
R R
i G G
., then the ine8ualit/
follows since R

% function for G. 1/ corollar/ 2, V

2
is not dependent. Let
[ ] ( )
1 1 2
& 2 ; G V
, and let 0
1
be the set of all pri"ate neighbors of 2
1
with
respect to V
2
. *hen ( )
,1- ,1- ,1-
1 0 1 2
; ; f V V V
is an RDF for G, <here
( ) { }
,1- ,1-
0 0 1 1 1 1 1
, V V 0 2 V V 0
and
{ }
,1-
2 2 1
. V V 2
If
,1-
2
V
is not independent,
then we let ( )
,1-
2 2 2
& 2 ; G V 1
]
, and let 0
2
be the set of all pri"ate neighbors of
2
2
with respect to
,1-
2
V
. *hen
( ) { } { }
( )
,2- ,1- ,2- ,1- ,2- ,1-
2 0 0 2 2 1 1 2 2 2 2
; ; f V V 0 2 V V 0 V V 2
is an RDF for G. 2ontinuing this process produces an RDF
( )
, - , - , -
0 1 2
; ;
+ + +
+
f V V V
for so3e integer 3 such that
, -
2
+
V
is independent. 1/
Le33a1, there is n R
i
function g such that i
R
(G) = "(g) # "(f
+
). !t follows
that
( ) ( ) ( ) ( )
+
R R
i G G + G +
. 1ut
2
, - , - 2
1 1
2 2
R R
G G
+ V


. )e
deduce that ( ) ( )
( )
( ) ( )
2
+ .
2
R
R R
G
i G G G

+ )e re3ar# that for agraph &
with 4,&- $+, *heore3 i3plies that i
R
(G) =
( )
R
G
. *his fact is also stated
in *heore3. !n the following we characteri9e all graphs & with
( ) + G >
achie"ing e8ualit/ in *heore3 .
Theorem:7 For a graph G "ith
( ) + G >
, ( ) ( ) ( ) ( )
, - 2
+
2
R
R R
G
i G G G

+
if and on(2 if either
, -
R
G
=
( ) 2
R
i G
, or
( ) ( ) 1 .
R
G G +
Proof. Let & be a graph with
( ) + G >
. First notice that if either
( ) ( ) ( ) 2, 6,
R R R
G i G or G ( ) ( ) 1
R
i G G +
,then
( ) ( )
( )
( ) ( )
2
+
2
R R
R G
i G G G

+ . Suppose that ( )
( )
( ) ( )
2
+
2
R
R G
G G

+ .
*he result is ob"ious for
( )
R
G
$ 2. So suppose that
( ) +
R
G
. Since
( ) + G >
,
( )
R
i G
and so b/ 2orollar/ 2 for an/ R

% function f= (V
0
;V
1
;V
2
) on
G, V
2
is not independent. Let f= (V
0
;V
1
;V
2
) be a R

% function on G, and let

: be the 3a7i3u3 independent subset of V
2
. )e obser"e that V
2
1 => . )e
proceed with Fact. 1
Fact 1.
[ ] [ ] ( ) ( )
2 2
1 $ V $ = G V =
. *o see this notice that
[ ] [ ] [ ] [ ]
2 2
. $ V $ = $ V = $ =
:lso
[ ] [ ] [ ] [ ]
2
2

V =
$ V $ = $ $ =

. 'ow
[ ] [ ] [ ] [ ]
2
2

V =
$ V $ = $ $ =

[ ] [ ]
2
V =
$ $ =

1ut for an/ 2

V =
b/ 3a7i3all/ of = we find that u is
ad;acent to a "erte7 1
' =
. *hus
[ ] [ ] 2 $ $ =
. )e deduce that
[ ] [ ] [ ] [ ] [ ] ( ) 1 $ $ = $ $ = $ G
. *his co3pletes a proof for
Fact 1.
Let
( ) ( ) [ ] ( )
; ; g $ = V G $ = =
. *hen g is an RDF for G. !t follows that
( ) ( ) [ ] 2 " g = V G $ = +
. Since
( ) [ ]
1
V V G $ =
, we obser"e that
( ) [ ] [ ] [ ] ( )
1 2
V G $ = V $ V $ =
. 'ow
( ) [ ] , - 2 " g = V G $ = +
[ ] [ ] ( )
1 2
2 = V $ V $ = +

[ ] [ ]
1 2
2 = V $ V $ = + +
:ppl/ing Fact 1, we obtain that
( ) ( )
1 2
, - 2 1 " g = V G V = + +

( ) ( ) ( )
1 2
2 1 = V G V = + +

( ) ( ) ( )
2 2 1 2
2 2 2 1 = V V V G V = + + +

( ) ( ) ( ) ( )
2
+
R
G V = G +

( )
( )
( ) ( )
1
+
2
R
R
G V
G = G

_
+

,

( )
( )
( ) ( )
1
2
+
2
R
R
G V =
G G

_
+

,
Since
( ) + G >
we find that
( ) 2
R
G
. !t is a routine 3atter to see that
1
2 2. V = +
*his leads that
( ) ( )
( )
( ) ( )
2
+
2
R
R
G
" g G G

_
+

,
. 1/
Le33a 1 there is an i
R
? fn!tion h for G such that
( ) ( ) ( ) ( )
( )
( ) ( ) ( )
2
+
2
R
R R R
G
i G " h " g G G i G

_
+

,
)e conclude that
( )
( )
( ) ( ) ( )
( )
( ) ( )
1
2 2
+ +
2 2
R R
R R
G V = G
G G G G


_ _
+ +

, ,
............1
and
[ ] [ ] ( ) ( )
2 2
1 $ V $ = G V =
..............2
*he relation,1- i3plies that 1
2 2 V = +
, and therefore 1
0 V
and
1 =
,*hen
[ ]
2
G V
is a co3plete graph. Let
[ ]
2 t
G V *
where
2 t
. Let
2
. V =
!t follows that
[ ] [ ] ( ) 1 , $ $ = G t +
and so

[ ] [ ] [ ] [ ]
2
2

V =
V =
$ $ = $ $ =

U

( ) ( )
2
1 G t V = +

( ) ( )
2
1 G V =
1ut relation ,2- i3plies that
( ) ( ) ( ) ( )
2 2
1 1 , G t V = G V = +
and
therefore t = 2. Since 1
0 V
, we deduce that
( ) 6
R
G
and so
( ) ( ) 1
R
i G G +
.
Theorem 10 For a graph G of order n,
( ) ( )
R
i G i G
if an on(2 if G =
n
*
Proof. !t is ob"ious that ( ) ( )
R n n
i * i *
. Let & be a graph of order n and
( ) ( )
R
i G i G
. Let
( )
0 1 2
; ; f V V V
be an R
i
function for &. !t follows that
( ) ( )
1 2 1 2
2
R
i G V V V V i G + +
)e deduce that 2
V
, and so
( ) . i G n
*hus, & $
n
*
Theorem 11: For a graph G of order n ,
( ) ( ) 1
R
i G i G +
if and on(2 if G has
a 'erte& of degree
( ) n i G
Proof . Let G has "erte7 ' with deg (') $ n%i(G). First let
( ) [ ] G G V G $ ' 1
]
1/ theore3
( ) ( )
R
i G V G
. Let
( )
0 1 2
; ; V V V
be an R
i
function for
G
. !t follows
that
( ) { } { }
( ) 0 1 2
; ; $ ' V V ' V


is an independent RDF &. )e conclude that
( ) ( ) 1
R
i G i G +
.
For the con"erse suppose that
( ) ( ) 1
R
i G i G +
. Let
( )
0 1 2
; ; g V V V
be an
R
i
function. Since 1 2
V V
is an independent do3inating set, we deduce that
2
1 V
. !f 2
V
, then 1
V
is not independent, which is a contradiction. So
2
1 V
. Let
{ }
2
V
. *hen an/ "erte7 of 0
V
is ad;acent to . So
( ) ( )
0 1 2
deg V n V V n i G
.