50320140501001

International Journal of Information Technology & Management Information System (IJITMIS),
ISSN 0976 6405(Print), ISSN 0976 6413(Online), Volume 5, Issue 1, January - February (2014), IAEME
1

MINIMAL DOMINATING FUNCTIONS OF CORONA PRODUCT
GRAPH OF A PATH WITH A STAR

1
Makke Siva Parvathi,
2
Bommireddy Maheswari

1
Dept.of Mathematics, K.R.K.Govt.Degree College, Addanki-523201, Andhra Pradesh, India
2
Dept. of Applied Mathematics, S.P.Womens University, Tirupat-517502,
Andhra Pradesh, India

ABSTRACT

Domination in graphs is an emerging area of research in recent years and has been
studied extensively. An introduction and an extensive overview on domination in graphs and
related topics is surveyed and detailed in the two books by Haynes et al. [1, 2].
Recently dominating functions is receiving much attention. They give rise to an
important classes of graphs and deep structural problems. In this paper we discuss some
results on minimal dominating functions of corona product graph of a path with a star.

Key Words: Corona Product, Path, Star, Dominating Function.

Subject Classification: 68R10

1. INTRODUCTION

Domination Theory is an important branch of Graph Theory that has wide range of
applications t o many fi el ds l i ke Engineering, Communication Networks, Soci al
Sc i e nce s , l i ngui s t i c s , Phys i ca l Sci e nce s and many others. Various domination
parameters of graphs are studied by Allan, R.B. and Laskar, R.[3]. The concept of minimal
dominating functions was introduced by Cockayne, E.J. and Hedetniemi, S.T. [4] and
Cockayne et al. [5]. Jeelani Begum, S. [6] has studied some dominating functions of
Quadratic Residue Cayley graphs.
Frucht and Harary [7] introduced a new product on two graphs G
1
and G
2

called corona product denoted by G
1
G
2
. The object is to construct a new and simple
operation on two graphs G
1

and G
2

called their corona, with the property that the group of
INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY &
MANAGEMENT INFORMATION SYSTEM (IJITMIS)

ISSN 0976 6405(Print)
ISSN 0976 6413(Online)
Volume 5, Issue 1, January - February (2014), pp. 01-11
IAEME: http://www.iaeme.com/IJITMIS.asp
Journal Impact Factor (2013): 5.2372 (Calculated by GISI)
www.jifactor.com

IJITMIS
I A E M E
2

the new graph is in general isomorphic with the wreath product of the groups of G
1
and of
G
2
.
The authors have studied some dominating functions of corona product graph of a
cycle with a complete graph [8] and published papers on minimal dominating functions, some
variations of Y dominating functions and Y total dominating functions [9,10,11].
In this paper we present some basic properties of corona product graph of a path
with a star and some results on minimal dominating functions.

2. CORONA PRODUCT OF
AND
,

The corona product of a path
with star
,
is a graph obtained by taking one
copy of a vertex path
and n copies of
,
and then joining the
vertex of
to
every vertex of
copy of
,
and it is denoted by

,
.
We present some properties of the corona product graph

,
without proofs
and the proofs can be found in Siva Parvathi, M. [8].
Theorem.2.1 : The graph

,
is a connected graph.
Theorem 2.2: The degree of a vertex
in

,
is given by
3,

2 1,
2,

1 ,
1,

,

,
2,

,

.

Theorem 2.3: The number of vertices and edges in

,
is given by
1. || 2,
2. || 2 1 1.
Theorem 2.4: The graph

,
is not eulerian.

,
is non hamiltonian.

,
is not bipartite.

3. DOMINATING SETS AND DOMINATING FUNCTIONS

In this section we discuss dominating sets (DS), dominating functions (DFs) of the
graph

,
. We present some results related to minimal dominating functions of
this graph.
Theorem 3.1: The domination number of

,
is .
Proof: Let D denote a dominating set of G.
Case 1: Suppose D contains the vertices of path
in G.
By the definition of the graph G which is the corona product of
and
,
, the

vertex
in
is adjacent to all vertices of i

th
copy of
,
. That is the vertices in

dominate the vertices in all copies of
,
respectively. Therefore the vertices in D dominate
all vertices of G. Thus D becomes a DS of G.
Case 2: Suppose D contains a vertex of degree 1 in each copy of
,
in G.
As there are n copies of
,
, it follows that || . Obviously these vertices in G
dominate the vertices in all copies of
,
respectively and also a single vertex of
to which
it is connected. Therefore the vertices of D dominate all vertices of G. Further this set is also
minimal. Thus .
3

Theorem 3.2: Let D be a MDS of

,
. Then a function : 0,1 defined by

otherwise. 0,
, v if 1, D

becomes a MDF of

,
.
Proof: Consider the graph

,
with vertex set V.
We have seen in Theorem 3.1 that a DS of contains all the vertices of
and this
set is minimal. Also the set of vertices whose degree is 1 in each copy of
,
form a
minimal DS of G.
Let D be a MDS of . For definiteness, let D contain the vertices of
in . In
, there are
two end vertices whose degree is 2 and there are 2 intermediate vertices whose
degree is 3 respectively in . In
,
, there is one vertex of degree 1 and there are
vertices whose degree is 2 respectively in .
Case 1: Let
be such that 3 in G.
Then
[ ]
( ) . 3 0 ....... 0 1 1 1
) 1 (
=
(
(
+ + + + + =
+
43 42 1
times m v N u
u f

Case 2: Let
Then
[ ]
( ) . 2 0 ....... 0 1 1
) 1 (
=
(
(
+ + + + =
+
43 42 1
times m
v N u
u f

Case 3: Let
,
Then
[ ]
( ) 1 0 ....... 0 1
) 1 (
=
(
(
+ + + =
+
43 42 1
times m v N u
u f .
Case 4: Let
,
Then
[ ]
( ) 1 0 0 1 = + + =
u f
v N u
.
Therefore for all possibilities, we get
[ ]
( ) , 1
u f
v N u
v V.
This implies that is a DF.
Now we check for the minimality of .
Define [ ] 1 , 0 : V g by

=
otherwise. 0,
}, {v - D for v 1,
, v for v r,
k
k
D

where 0 1.
Since strict inequality holds at the vertex , D v
k
it follows that .
Case (i): Let
Sub case 1: Let [ ] v N v
k
.
Then
[ ]
( ) . 1 2 0 ....... 0 1 1
) 1 (
> + =
(
(
+ + + + + =
+
r r u g
times m
v N u
43 42 1

k
.
4

Then
[ ]
( ) . 3 0 ....... 0 1 1 1
) 1 (
=
(
(
+ + + + + =
+
43 42 1
times m v N u
u g

Case (ii): Let
k
.
Then
[ ]
( ) . 1 1 0 ....... 0 1
) 1 (
> + =
(
(
+ + + + =
+
r r u g
times m v N u
43 42 1

k
.
Then
[ ]
( ) . 2 0 ....... 0 1 1
) 1 (
=
(
(
+ + + + =
+
43 42 1
times m v N u
u g

Case (iii): Let
,
k
.
Then
[ ]
( ) . 1 0 ....... 0
) 1 (
< =
(
(
+ + + =
+
r r u g
times m
v N u
43 42 1

k
.
Then
[ ]
( ) . 1 0 ....... 0 1
) 1 (
=
(
(
+ + + =
+
43 42 1
times m
v N u
u g

Case (iv): Let
,
k
.
Then
[ ]
( ) . 1 0 0 < = + + =
r r u g
v N u

k
.
Then
[ ]
( ) . 1 0 0 1 = + + =
u g
v N u

This implies that
[ ]
( ) 1 <
u g
v N u
, for some v V.
So is not a DF.
Since is taken arbitrarily, it follows that there exists no such that is a DF.
Thus is a MDF.
Theorem 3.3: A function 0, 1 defined by
, is a DF of

,
, if 3. It is a MDF if 3.
Proof: Let be a function defined as in the hypothesis.
Case I: Suppose 3.
Case 1: Let
So
[ ]
( )
( )
, 1
4 1
.......
1 1
4
>
+
= + + + =
+
q
m
q q q
u f
times m
v N u
4 4 3 4 4 2 1
since 3 and 2.

Case 2: Let
So
[ ]
( )
( )
, 1
3 1
.......
1 1
3
>
+
= + + + =
+
q
m
q q q
u f
times m
v N u
4 4 3 4 4 2 1
since 3 and 2.

Case 3: Let
,
5

So
[ ]
( )
( )
, 1
2 1
.......
1 1
2
>
+
= + + + =
+
q
m
q q q
u f
times m
v N u
4 4 3 4 4 2 1

since 3 and 2.
Case 4: Let
,
So
[ ]
( ) , 1
3 1 1 1
> = + + =
q q q q
u f
v N u

since 3.
[ ]
( ) , 1 >
u f
v N u
v V.

=
otherwise. ,
q
1
, v v if r,
k
V

where 0
.
Since strict inequality holds at a vertex
of V, it follows that .
Case (i): Let
k
.
Then
[ ]
( )
( )
4 4 3 4 4 2 1
times m
v N u
q q q
r u g
+
+ + + + =
3
1
.......
1 1
, 1
4 3 1
>
+
=
+
+ <
q
m
q
m
q

since 3 and 2.
k
.
The
[ ]
( )
( )
, 1
4 1
.......
1 1
4
>
+
= + + + =
+
q
m
q q q
u g
times m
v N u
4 4 3 4 4 2 1

since 3 and 2.
Case (ii): Let
Sub case 1:Let [ ] v N v
k
.
Then
[ ]
( )
( )
4 4 3 4 4 2 1
times m
v N u
q q q
r u g
+
+ + + + =
2
1
.......
1 1
, 1
3 2 1
>
+
=
+
+ <
q
m
q
m
q
since 3 and 2.
k
.
Then
[ ]
( )
( )
, 1
3 1
.......
1 1
3
>
+
= + + + =
+
q
m
q q q
u g
times m
v N u
4 4 3 4 4 2 1
since 3 and 2.
Case (iii): Let
,
k
.
Then
[ ]
( )
( )
4 4 3 4 4 2 1
times m
v N u
q q q
r u g
+
+ + + + =
1
1
.......
1 1
, 1
2 1 1
+
=
+
+ <
q
m
q
m
q
since 3 and
2.
k
.
6

So
[ ]
( )
( )
, 1
2 1
.......
1 1
2
>
+
= + + + =
+
q
m
q q q
u g
times m
v N u
4 4 3 4 4 2 1
since 3 and 2.
Case (iv): Let
,
Sub case 1: Let
[ ] v N v
k

.
Then
[ ]
( ) ,
3 1 1
q q q
r u g
v N u
< + + =

since 3, it follows that
. 1
3
>
q

k
.
Then
[ ]
( ) , 1
3 1 1 1
> = + + =
q q q q
u g
v N u
since 3.
Hence, it follows that
[ ]
( ) , 1
u g
v N u
. V v
Thus is a DF.
This implies that is not a MDF.
Case II: Suppose 3.
Substituting q = 3 in case I, for
such that 3, we have

[ ]
( )
( )
, 1
3
1
1
3
4 4 1
.......
1 1
4
>
+
+ =
+
=
+
= + + + =
+
m m
q
m
q q q
u f
times m
v N u
4 4 3 4 4 2 1

and for

[ ]
( )
( )
. 1
3
1
3
3 3 1
.......
1 1
3
> + =
+
=
+
= + + + =
+
m m
q
m
q q q
u f
times m
v N u
4 4 3 4 4 2 1

Also for
,
[ ]
( )
( )
, 1
3
2 2 1
.......
1 1
2
>
+
=
+
= + + + =
+
m
q
m
q q q
u f
times m
v N u
4 4 3 4 4 2 1
since 2.
And for
,
[ ]
( ) . 1
3
3 3 1 1 1
= = = + + =
q q q q
u f
v N u

[ ]
( ) , 1
u f
v N u
. V v
This implies that is a DF. Now we check for the minimality of .

=
otherwise. ,
q
1
, v for v r,
k
V

where 0
.
Then we can show as in case (i) that for
such that 3,
7

[ ]
( )
( )
, 1
1
.......
1 1
3
> + + + + =
+
4 4 3 4 4 2 1
times m
v N u
q q q
r u g
if [ ], v N v
k

and
[ ]
( )
( )
, 1
3
1
1
3
4 4 1
.......
1 1
4
>
+
+ =
+
=
+
= + + + =
+
m m
q
m
q q q
u g
times m
v N u
4 4 3 4 4 2 1
if [ ] v N v
k
.
Again as in case (ii), for
such that 2,
We have
[ ]
( )
( )
, 1
1
.......
1 1
2
> + + + + =
+
4 4 3 4 4 2 1
times m
v N u
q q q
r u g
if [ ] v N v
k
.
And
[ ]
( )
( )
, 1
3
1
3
3 3 1
.......
1 1
3
> + =
+
=
+
= + + + =
+
m m
q
m
q q q
u g
times m
v N u
4 4 3 4 4 2 1

if [ ] v N v
k
.

Again we can see as in case (iii) that for
,
such that 1,
[ ]
( )
( )
, 1
1
.......
1 1
1
> + + + + =
+
4 4 3 4 4 2 1
times m
v N u
q q q
r u g

if [ ] v N v
k
.
And
[ ]
( )
( )
, 1
3
2 2 1
.......
1 1
2
>
+
=
+
= + + + =
+
m
q
m
q q q
u g
times m
v N u
4 4 3 4 4 2 1

if [ ] v N v
k
.
Similarly we can show as in case (iv) that for
,
such that 2,

[ ]
( )
q q
r u g
v N u
1 1
+ + =
, 1
3
3 3
= = <
q
if [ ], v N v
k

and
[ ]
( ) , 1
3
3 3 1 1 1
= = = + + =
q q q q
u g
v N u
if [ ] v N v
k
.
This implies that
[ ]
( ) 1 <
u g
v N u
, for some v V.
So is not a DF.
Since is defined arbitrarily, it follows that there exists no such that is a DF.
Thus is a MDF.
Theorem 3.4: A function [0, 1] defined by
, where
, and , is a DF of

,
, if
.
Otherwise it is not a DF. Also it becomes MDF if
.
Proof: Let : [ 0, 1 ] be defined by
, where , and
, . Clearly
0.
Case 1: Let
be such that 3 in .
So
[ ]
( )
( )
( ) . 4 .......
4
q
p
m
q
p
q
p
q
p
u f
times m
v N u
+ = + + + =
+
4 4 4 3 4 4 4 2 1

Case 2: Let
be such that 2 in .
8

So
[ ]
( )
( )
( ) . 3 .......
3
q
p
m
q
p
q
p
q
p
u f
times m
v N u
+ = + + + =
+
4 4 4 3 4 4 4 2 1

Case 3: Let
,
be such that 1 in .
So
[ ]
( )
( )
( ) . 2 .......
2
q
p
m
q
p
q
p
q
p
u f
times m
v N u
+ = + + + =
+
4 4 4 3 4 4 4 2 1

Case 4: Let
,
be such that 2 in .
So
[ ]
( ) . 3
q
p
q
p
q
p
q
p
u f
v N u
= + + =

From the above four cases, we observe that is a DF if
.
Otherwise is not a DF.
Case 5: Suppose
.
Clearly is a DF.

=
otherwise. ,
q
p
, v for v r,
k
V

where 0
.
Case (i): Let
be such that 3 in .
k
.
Then
[ ]
( )
( )
4 4 4 3 4 4 4 2 1
times m
v N u
q
p
q
p
q
p
r u g
+
+ + + + =
3
....... ( ) ( ) , 1 4 3 > + = + + <
q
p
m
q
p
m
q
p
since
and m
2.

k
.
Then
[ ]
( )
( )
( ) , 1 4 .......
4
> + = + + + =
+
q
p
m
q
p
q
p
q
p
u g
times m
v N u
4 4 4 3 4 4 4 2 1
since
and m 2.
Case (ii): Let
be such that 2 in .
k
.
Then
[ ]
( )
( )
4 4 4 3 4 4 4 2 1
times m
v N u
q
p
q
p
q
p
r u g
+
+ + + + =
2
....... ( ) ( ) , 1 3 2 > + = + + <
q
p
m
q
p
m
q
p
since
and m
2.
k
.
Then
[ ]
( )
( )
( ) , 1 3 .......
3
> + = + + + =
+
q
p
m
q
p
q
p
q
p
u g
times m
v N u
4 4 4 3 4 4 4 2 1
since
and m 2.
Case (iii): Let
,
be such that 1 in .
9

k
.
Then
[ ]
( )
( )
4 4 4 3 4 4 4 2 1
times m
v N u
q
p
q
p
q
p
r u g
+
+ + + + =
1
....... ( ) ( ) , 1 2 1 > + = + + <
q
p
m
q
p
m
q
p
since
and m 2.
k

.
Then
[ ]
( )
( )
( ) , 1 2 .......
2
> + = + + + =
+
q
p
m
q
p
q
p
q
p
u g
times m
v N u
4 4 4 3 4 4 4 2 1
since
and m 2.
Case (iv): Let
,
be such that 2 in .
k

.
Then
[ ]
( ) , 1 3 > < + + =
q
p
q
p
q
p
r u g
v N u
since
.
k
.
Then
[ ]
( ) , 1 3 > = + + =
q
p
q
p
q
p
q
p
u g
v N u
since
.
Hence, it follows that
[ ]
( ) , 1 >
u g
v N u

v V.
Thus is a DF. This implies that is not a MDF.
Case 6: Suppose
.
As in case 1, we can show for
such that 3,

[ ]
( )
( )
|
|
\
|
+ = + + + =
+
q
p
m
q
p
q
p
q
p
u f
times m
v N u
) 4 ( .......
4
4 4 4 3 4 4 4 2 1
( ) . 1
3
1
1
3
1
4 >
+
+ = |
\
|
+ =
m
m

Again as in case 2, for

[ ]
( )
( )
( ) 1
3
1
3
1
3 ) 3 ( .......
3
> + = |
\
|
+ =
|
|
\
|
+ = + + + =
+
m
m
q
p
m
q
p
q
p
q
p
u f
times m
v N u
4 4 4 3 4 4 4 2 1
.
We can show as in case 3, for
,
such that 1,

[ ]
( )
( )
( ) 1
3
1
1
3
1
2 ) 2 ( .......
2
>
+ = |
\
|
+ =
|
|
\
|
+ = + + + =
+
m
m
q
p
m
q
p
q
p
q
p
u f
times m
v N u
4 4 4 3 4 4 4 2 1
.
Again as in case 4, we can show for
,
such that 2,

[ ]
( ) . 1
3
1
3
q
p
3 = = = + + =
q
p
q
p
q
p
u f
v N u

[ ]
( ) , 1
u f
v N u

v V.

=
otherwise. ,
q
p
, v for v r,
k
V

10

where 0
.
Then we can show as in case (i), (ii) and (iii) of case 5 that
[ ]
( ) , 1 >
u g
v N u
if
and [ ] v N v
k
or [ ] v N v
k
.
Now we can show as in case (iv) of case 5 that

[ ]
( ) , 1 < + + =
q
p
q
p
r u g
v N u
if
,
and [ ] v N v
k
.
And
[ ]
( ) , 1
3
1
3 3 = |
\
|
=
|
|
\
|
= + + =
q
p
q
p
q
p
q
p
u g
v N u
if
,
and [ ] v N v
k
.
This implies that
[ ]
( ) 1 <
u g
v N u
, for some vV. So is not a DF.
Since is defined arbitrarily, it follows that there exists no such that is a DF.
Thus is a MDF.

ILLUSTRATION

1
1
1
1
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 0
0

,

The function f takes the value 1 for vertices of P
5
and value 0 for vertices in each copy of
K
1,3

11

REFERENCES

[1] Haynes, T.W., Hedetniemi, S.T. and Slater, P.J. - Domination in Graphs: Advanced
Topics, Marcel Dekker, Inc., New York, (1998).
[2] Haynes, T.W., Hedetniemi, S.T. and Slater, P.J. - Fundamentals of domination in
graphs, Marcel Dekker, Inc., New York , (1998).
[3] Allan, R.B. and Laskar, R.C. On domination, independent domination numbers of a
graph. Discrete Math., 23 (1978), 73 76.
[4] Cockayne, E.J. and Hedetniemi, S.T. - Towards a theory of domination in graphs.
Networks, 7 (1977), 247 261.
[5] Cockayne, E.J., Mynhardt, C.M. and Yu, B. - Total dominating functions in trees:
Minimality and Convexity, Journal of Graph Theory, 19(1995), 83 92.
[6] Jeelani Begum, S. - Some studies on dominating functions of Quadratic Residue
Cayley Graphs, Ph. D. thesis, Sri Padmavathi Mahila Visvavidyalayam, Tirupati,
Andhra Pradesh, India, (2011).
[7] Frucht, R. and Harary, F. - On the corona of Two Graphs, Aequationes Mathematicae,
Volume 4, Issue 3 (1970), 322 325.
[8] Siva Parvathi, M Some studies on dominating functions of corona product graphs,
Ph.D thesis, Sri Padmavati Mahila Visvavidyalayam, Tirupati, Andhra Pradesh, India,
(2013).
[9] Siva Parvathi, M and Maheswari, B. - Minimal Dominating Functions of Corona
Product Graph of a Cycle with a Complete Graph - International Journal of Computer
Engineering & Technology, Volume 4, Issue 4 (2013), 248 256.
[10] Siva Parvathi, M and Maheswari, B. - Some variations of Y-Dominating Functions of
Corona Product Graph of a Cycle with a Complete Graph- International Journal of
Computer Applications, Volume 81, Issue 1 (2013), 16 21.
[11] Siva Parvathi, M and Maheswari, B. - Some variations of Total Y-Dominating
Functions of Corona Product Graph of a Cycle with a Complete Graph - Fire Journal
Science and Technology (accepted).
[12] Syed Abdul Sattar, Mohamed Mubarak.T, Vidya PV and Appa Rao - Corona Based
Energy Efficient Clustering in WSN - International Journal of Advanced Research in
Engineering & Technology (IJARET), Volume 4, Issue 3 (2013), 233 242.
[13] M.Manjuri and B.Maheswari - Strong Dominating Sets of Strong Product Graph of
Cayley Graphs with Arithmetic Graphs - International Journal of Computer
Engineering & Technology, Volume 4, Issue 6 (2013), 136 - 144.

50320140501001

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

50320140501001

Uploaded by

Copyright:

Available Formats

International Journal of Information Technology & Management Information System (IJITMIS),

is adjacent to all vertices of i

such that 3, we have

such that 2, we have

such that 2, we have

You might also like