IOSR Journal of Mathematics (IOSR-JM) e-ISSN: 2278-3008, p-ISSN:2319-7676. Volume 10, Issue 2 Ver. IV (Mar-Apr. 2014), PP 17-22 www.iosrjournals.org

On Restrained 2-Domination Number of the Join and Corona of Graphs 1 1,2

Esamel M. Paluga, 2Rolando N. Paluga

Department of Mathematics Caraga State University Ampayon, Butuan City 8600, Philippines

Abstract : Let G be a graph. A subset S of V (G) is a restrained 2-dominating set if every vertex of

V (G) \ S is adjacent to at least two vertices of S and every vertex of V (G) \ S is adjacent to at least one vertex in V (G) \ S . The restrained 2 -domination number of G , denoted by  r 2 (G) , is the smallest cardinality of a restrained 2 -dominating set G . In this paper, we characterize the graphs obtained in the join of two graphs having  r 2 (G) = 2,3,4 . We also characterize restrained 2 -dominating sets in the corona of two graphs and give a formula for computing the restrained 2 -domination number. I.

Introduction

G = (V (G), E (G)) a dominating S  V (G) is a restrained dominating set if every vertex of V (G) \ S is adjacent to a vertex in S and to a vertex in V (G) \ S . The cardinality of a minimum restrained dominating set is the restrained domination number of G and is denoted by  r (G) . A dominating S  V (G) is a 2 -dominating set if every vertex in V (G) \ S is adjacent to at least two vertices in S . The 2 -domination number of G , denoted by  2 (G) , is the cardinality of a minimum 2 -dominating set of G . A dominating set S  V (G) is called a restrained 2 -dominating set if every vertex in V (G) \ S is adjacent to at least two vertices in S and to a vertex in V (G) \ S . The restrained 2 -domination number of G , denoted by  r 2 (G) , is the cardinality of a minimum restrained 2 -domination set. The join of any graphs G and H , denoted by G  H , is the graph with V (G  H ) = V (G) V ( H ) and E(G  H ) = E(G)  E( H ) {uv : u V (G) and v V (H )} . The corona of G and H , denoted by G  H is defined as the graph obtained by taking one copy of G (which has p vertices) and p copies of H , and then joining the ith vertex of G to every vertex in the ith copy of H . We denote the copy of H with respect to vertex a V (G) by H a . The neighbor of a vertex x in G , denoted by N G (x) is the set of all vertices adjacent to x , i.e., NG ( x) = { y  G | xy  E (G)} . Given a connected graph

The concept of domination has been the subject of so may researches in the last few decades due to its application in many fields, such as network topologies, location problems, protection strategies, etc. Another domination variant was introduced in [1] which was derived from two existing dominations concepts independently introduced by Telle,et al [4] and Fink, et al [7]. In [1], the authors provided some characterizations and bounds for the restrained 2 -domination of a graph. Furthermore, it contained the restrained 2 -domination numbers of special graphs. This present work invetigated intensively the concept of restrained 2 -domination in some graphs resulting from binary operations, such as the join and corona of graphs, which were not tackled by Kelkar, et. al. Important results on characterization of restrained 2 -domination sets were presented here and corresponding formulas for computing the restrained 2 -domination were also explicitly given. Throughout this paper, G = (V (G), E (G)) is a simple undirected and connected graph. The order of

G ,denoted by G , is the cardinality of V (G) . For other graph theoretic terms which are assumed here, readers are advised to refer to [5].

www.iosrjournals.org

17 | Page

On Restrained 2-Domination Number of the Join and Corona of Graphs II.

Join of two Graphs

Theorem 2.1 Let G and H be connected graphs. Then 2   r 2 (G  H )  4 . Proof. A minimum r 2 -dominating set must contain at least two vertices, hence, Suppose

2   r 2 (G  H ) .

G = 2 . Let S = a, b = V (G) and x V (G  H ) \ S . Then x V (H ) . It follows thhat

N S (x) = 2 . Since H is connected, there exists y V ( H ) = V (G  H ) \ S such that x and y are adjacent in H , and so

x and y are adjacent in G  H . Thus,  r 2 (G  H ) = 2 . Similarly, if H = 2 ,

 r 2 (G  H ) = 2 . Suppose

G  3 and H  3 . Let S = a, b, c, d  whhere a, b V (G) and c, d V ( H ) . Let

x V (G  H ) \ S . If x V (G) \ a, b, then N S ( x)  2 and there exists wV (H ) such that x and

w are adjacent in G  H . If x V ( H ) \ c, d  , then N S ( x)  2 and there exists u V (G) such that x and

u are adjacent in G  H . Hence, S is a r 2 -dominating set in G  H . Accordingly,  r 2 (G  H )  4 .

+ Theorem 2.2 Let G and H be connected graphs of order at least two. Then one of the following holds:

 r 2 (G  H ) = 2 if and only if

G = 1 or H = 1 ; 2.  (G) = 1 and  (H ) = 1 ; 3.  2 (G) = 2 or  2 ( H ) = 2 . Proof. Suppose  r 2 (G  H ) = 2 . If (i ) or (iii ) holds, then we are done. Suppose that instead of (i ) and (ii ) i.e., the following conditions hold: 1. G  3 and H  3 ; and 1.

2.

 2 (G)  3 or  2 ( H )  3 .

S = a, b be a minimum r 2 -dominating set in G  H . Suppose a, b V (G) and x V (G) \ a, b. Then x V (G  H ) \ S . Since S is an r 2 -dominating set in G  H , a, b  NG ( x) . This implies that a, b is a 2-dominating set in G . Thus,  2 (G)  2 . This contradicts (a ) . Similarly, if a, b V ( H ) , we will also obtain a contradiction. Hence, a V (G) and b V (H ) . Let x V (G) \ a. Then x V (G  H ) \ S . Since S is an r 2 -dominating set, N S ( x) = a, b . It follows that NG ( x) = a. Thus, a is a dominating set in G . This implies that  (G)  1 . Hence,  (G) = 1 . Similarly,  ( H )  1 . Hence, (ii ) holds. Conversely, suppose (i ) holds. Then following the case in the proof of Theorem 2.1,  r 2 (G  H ) = 2 . Suppose (ii ) holds. Assume G  3 and H  3 . Let S = a, b where a and b are Let

G and H , respectively. Let x V (G  H ) \ S . If x V (G) \ a, then x and a are adjacent in G . In effect, N S ( x) = a, b . Moreover, there exists w V ( H ) \ b  V (G  H ) \ S such that x and w are adjacent in G  H . The same conclusion is obtained if x V (G) \ b. Thus, S is an r 2 -dominating set in G  H . In effect,  r 2 (G  H )  2 . By Theorem 2.1,  r 2 (G  H ) = 2 . Suppose (iii ) holds. Assume  2 (G) = 2 . Let S = a, b be a minimum 2 -dominating set in G . N S (x) = 2 . Moreover, there exists Let x V (G  H ) \ S . Suppose x V (G) \ S . Then dominating sets in

www.iosrjournals.org

18 | Page

On Restrained 2-Domination Number of the Join and Corona of Graphs

w V ( H )  V (G  H ) \ S such that x and w are adjacent in G  H . Thus, S is an r 2 -dominating set in G  H Hence,  r 2 (G  H ) = 2 . Similarly, if  2 ( H ) = 2 , we have  r 2 (G  H ) = 2 . + Theorem 2.3 Let

 r 2 (G  H ) = 3

G and H be connected graphs such that  2 (G)  3 and  2 ( H )  3 . Then if and only if one of the following holds:

 (G) = 1 and  ( H )  2 ;  (G)  2 and  (H ) = 1 ;  (G) = 2 or  (H ) = 2 ;  2 (G) = 3 or  2 ( H ) = 3 .

1. 2. 3. 4.

 r 2 (G  H ) = 3 . Then by Theorem 2.2, the following must hold:  (G)  2 or  ( H )  2 ;  2 (G)  3 and  2 ( H )  3 . Let S = a, b, c be an r 2 -dominating set in G  H . Consider the following cases:

Proof. Suppose 1. 2.

a, b V (G) and c V (H ) . Then a, b is a dominating set in G . Consequently,  (G)  2 . Suppose  (G) = 1 . Then by (1) ,  ( H )  2 . Thus, (i ) holds. If  (G) = 2 , then (iii ) holds. Case 2. a V (G) and b, c V ( H ) . Following the argument in Case 1, (ii ) or (iv ) holds. Case 3. a, b, c V (G) . Then a, b, c is a 2 -dominating set in G . In effect,  2 (G)  3 . By Theorem 2.2,  2 (G) = 3 . Thus, (iv ) holds. Case 4. a, b, c V ( H ) . Following the argument in Case 3, we have  2 ( H ) = 3 . Thus, (iv ) Case 1.

holds.

S = a, b, c, where a, b V (G) and c V (H ) and a is a dominating set in G . Let x V (G  H ) \ S . Suppose x V (G) \ a, b. Note that N S ( x)  2 . Conversely, assume (i ) holds. Let

w V ( H ) \ c such that x and w are adjacent in G  H . Suppose x V ( H ) \ c . Then N S ( x)  2 and there exists u V (G) such that x and u are adjacent in G  H . Thus, S is an Moreover there exists

r 2 -dominating in G  H . Accordingly,  r 2 (G  H )  3 . Following the proof of Theorem 2.2, we will obtain a contradiction if  r 2 (G  H ) = 2 . Thus,  r 2 (G  H ) = 3 . Similarly, if (ii ) holds,  r 2 (G  H ) = 3 . Suppose  (G) = 2 . Let S = a, b, c where a, b is a minimum dominating set in G and

c V (H ) . Let x V (G  H ) \ S . Suppose x V (G) \ a, b. Then N S ( x)  2 and there exists

w V ( H ) \ c such that x and w are adjacent. Suppose x V ( H ) \ c. Then N S ( x)  2 and there

u V ( H ) \ a, b such that x and u are adjacent. Thus, S is an r 2 -dominating set. Accordingly,  r 2 (G  H )  3 . Following the argument in the proof of Theorem 2.2, we will obtain a contradiction if  r 2 (G  H ) = 2 . Thus,  r 2 (G  H ) = 3 . Similarly, if  (H ) = 2 ,  r 2 (G  H ) = 3 . Suppose  2 (G) = 3 . Let S = a, b, c be a 2-dominating set in G . Let x V (G  H ) \ S . Suppose x V (G) \ S . Then N S ( x)  2 and there exists w V ( H )  V (G  H ) \ S such that x and exists

w are adjacent. Suppose x V (H ) . Then N S ( x)  3 and there exists w V ( H )  V (G  H ) \ S such that

x and w are adjacent. Thus, S is an r 2 -dominating set. Accordingly,  r 2 (G  H )  3 . Following the www.iosrjournals.org

19 | Page

On Restrained 2-Domination Number of the Join and Corona of Graphs argument in the proof of Theorem 2.2, we will obtain a contradiction if

 r 2 (G  H ) = 3 . Similarly, if  2 ( H ) = 3 we have  r 2 (G  H ) = 3 . III.

 r 2 (G  H ) = 2 .

Thus,

+

Corona of Two Graphs

G be a connected graph of order at least two. Then  r 2 (G  K1 ) . Proof. Let V (G) = ai : 1  i  n and A = bi : 1  i  n. Let V (G  K1 ) = V (G)  A and E (G  K1 ) = aibi : 1  i  n E (G) . Let S = A  B , where B is a minimum r -dominating set in G , and x V (G  K1 ) \ S . Then x V (G) \ B . Note that x = ak , for some k , with 1  k  n . Since B is r -dominating in G , there exist p and q , with 1  p, q  n , such that a p  B , aq V (G) \ B , and x is Theorem 3.1 Let

adjacent to both a p and aq . Now

x is adjacent to bk  A  S , so N S ( x)  2 and NV (G K

1)\ S

( x)  1 .

S is an r 2 -dominating set in G  K1 . Hence,  r 2 (G  K1 )  S = A  B = G   r (G) . Let S  be a minimum r 2 -dominating set in G  K1 . Suppose there exists i , with bi  S  , 1  i  n . Since Thus

S  is an r 2 -dominating set in G  K1 , N S  (bi )  2 . This is a contradiction since N (bi ) = ai . Thus, A  S . Suppose V (G)  S  is not an r -dominating set in G  K1 . This implies that there exists x V (G) \ (V (G)  S ) such that NV (G )S  ( x) =  or NV (G ) \ S  ( x) =  . If NV (G )S  ( x) =  , then N S (x) = 1. This contradicts the fact that S  is an r 2 -dominating set. If NV (G ) \ S  ( x) =  , then NV (G K

1)\ S

( x) =  . This is also a contradiction. Thus, V (G)  S  is an r -dominating set in G . Hence,

 r 2 (G  K1 ) = S ' = A  V (G)  S '  G   r (G) Therefore,

 r 2 (G  K1 ) = G   r (G) .

Theorem 3.2 Let Proof. Let

n  2 and G be a connected graph of order at least 2. Then  r 2 (G  K n ) = 2 G

V (G) = ai : 1  i  G  and for each i with 1  i  G , let Ai = bij : 1  j  n such that

Ai  K n . Let V (G  K n ) = V (G)  (i =1Ai ) and E (G  K n ) = E (G)  i =1ai bij : 1  j  n . Let G

G

S = i =1bij : j = 1,2 and x V (G  K n ) \ S . Then x = bij for some i and j , with 1  i  G and G

3  j  n , or x = ak for some k , with 1  k  G . If x = bij , then N S ( x) = bi1 , bi 2  and

ai  NV (G K such that

n )\ S

( x) . If x = ak , then N S ( x) = bk1 , bk 2  and there exists u V (G)  V (G  K n ) \ S

x and u are adjacent. Thus, in any case, S is an r 2 -dominating set in G  K n . Accordingly,

 r 2 (G  K n )  S = 2 G . Let that

S  be a minimum r 2 -dominating set in G  K n . Suppose there exists i with 1  i  G , such

S   ( Ai  ai )  1 . Let bik  Ai \ S   V (G  K n ) \ S  . Now,

S   ( Ai  ai )  1 , so

N S  (bik )  1 . This contradicts the fact that S  is an r 2 -dominating set. Thus, S   ( Ai  ai )  2 . Hence,

 r 2 (G  K n ) = S = '

G

(S

'

 ( Ai  ai ))

i =1

www.iosrjournals.org

20 | Page

On Restrained 2-Domination Number of the Join and Corona of Graphs G

G

=  S  ( Ai  ai )  2 = 2 G . '

i =1

i =1

 r 2 (G  K n ) = 2 G

Therefore,

.

Lemma 3.3 Let H be a connected graph of order at least three. Then

 2 (H ) < H

.

Proof. Let H be a connected graph of order at least three. Suppose deg (a) = 1 for every a V (H ) . Let

b V (H ) such that ab  E (H ) . Let c V ( H ) \ a, b. Then ac, bc  E ( H ) . This means that H is disconnected, which is a contradiction. Thus, there exists a V (H ) such that deg (a)  2 . Let

S = V ( H ) \ a and x V ( H ) \ S , i.e., x = a . Then N S ( x)  2 . Thus, S is a 2-dominating set in H .

Hence,

c = S = H 1 < H .

+

G and H be connected graphs of order at least three. Then  r 2 (G  H ) =minG   2 ( H ), G  r ( H )  G 

Theorem 3.4 Let

Proof.

a V (G) , let

For each

H a  H . Let V (G  H ) = V (G)  (aV (G ) V ( H a )) and

E (G  H ) = E (G)  (aV (G ) ax : x V ( H a )) . For each a V (G) , let S a be a minimum 2dominating set in

H a . By Lemma 3.3, S a < H for every a V (G) . Note that S a  2 for every

a V (G) . Let S1 = aV (G ) Sa and x V (G  H ) \ S1 . If x V (G) , then N S ( x) = S a  2 and 1

there exists

b V (G)  V (G  H ) \ S1 such that b and x are adjacent. If x V ( H a ) \ Sa for some

a V (G) , then N S ( x)  N S  2 and x and a are adjacent. Thus, S1 is an r 2 -dominating set in 1

a

G  H . Hence,

 r 2 (G  H )  S =

aV ( G )

Sa = G   2 ( H )

 2 ( H )   r ( H )  1 . Then  r 2 (G  H ) minG   2 ( H ), G  r ( H )  G . Suppose  r ( H )  1 <  2 ( H ) . For each a V (G) , let Ta Suppose

3.3,

be a minimum r -dominating on

H a . By Lemma

Ta  1 < H foe every a V (G) . Let S2 = aV (G )(Ta  a) and x V (G  H ) \ S2 . Then

x V ( H a ) \ Ta for some a V (G) . Since Ta is an r -dominating set in H a , there exist u  Ta and x  H a \ Ta such that x is adjacent to both u and v . Thus, N S ( x)  2 and NV (G H ) \ S ( x)  1 . 2

2

S 2 is an r 2 -dominating set in G  H . Hence,  r 2 (G  H )  S =  ( Ta  1) = G ( r ( H )  1)

Consequently,

aV ( G )

minG   2 ( H ), G  r ( H )  G  Let

S be a minimum r 2 -dominating set in G  H . Then     S = A    (V ( H a )  S )   (V ( H a )  S )   aA   aA\ A  where S  V (G) . Suppose a V (G) and x V ( H a ) \ (V ( H a )  S ) . Since S is an r 2 -

dominating

set,

NV (G H ) \ S ( x)  1 .

Since

N S ( x) = a NV ( H

www.iosrjournals.org

a )S

( x)

and 21 | Page

On Restrained 2-Domination Number of the Join and Corona of Graphs

NV (G H ) \ S ( x) = NV ( H

a )\ S

( x) , NV ( H

Suppose a V (G) \ A and Now, . Let

N S ( x) = NV ( H

a ) S

a )\ S

( x)  1 . Thus, NV ( H

is r -dominating, if

a A.

x V ( H a ) \ (V ( H a )  S ) . Since S is an r 2 -dominating set, N S ( x)  2 .

( x) , so NV ( H

a )S

( x)  2 . Thus, V ( H a )  S is 2-dominating if a V (G) \ A

 =min 2 ( H ),  r ( H )  1. Hence,  r 2 (G  H ) = S = A   V ( H a )  S   A   ( r ( H ))  aA)

a ) S

aA)

aV ( G ) \ A)

aV ( G ) \ A)

V (H a )  S

( 2 ( H ))

= A  A   r ( H )  ( G  A ) 2 ( H )  A  A    ( G  A ) = A  A   G   A

= A  G  G The result now follows.

+ References

[1]. [2]. [3]. [4]. [5]. [6]. [7].

I.P. Kelkar, J.J. Mohan . Restrained 2-Domination in Graphs. IOSR Journal of Engineerin, Vol 2, Issue 8, August 2010, pp. 06-09. Wai Chee Shiu, et.al. On the total restrained domination number of direct product of graphs. Discussiones Mathematicae: Graph Theory 2012, Vol 32, Issue 4 page 629. M.H.Muddebihal, D. Busavarajappa, A.R. Sedamkar Restrained Domination in Graphs. Canadian Journal on Science and Engineering Mathematics. Vol 2 No.5, Dec 2011 J.A. Telle and A. Proskurowski. Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Mathematics, 10(1997), 529-550. F. Harary, Graph Theory. Addison-Wesley, Reading MA (1969). O. Ore. Theory of graphs. American Mathematical Society Colloquium Publications, Vol XXXVIII, American Mathematical Society, Providence, R.I. 1962. J.F. Fink, M.S. Jacobson, On n-domination, n-dependence and forbidden subgraphs. Graph Theory with Applications to Algorithms and Computer Science, New York, Wiley, 1985, 301-312

www.iosrjournals.org

22 | Page

C010241722