Equi independent equitable domination number of cycle and bistar related graphs

IOSR Journal of Mathematics (IOSR-JM)
e-ISSN: 2278-5728, p-ISSN: 2319-765X. Volume 11, Issue 6 Ver. IV (Nov. - Dec. 2015), PP 26-32
www.iosrjournals.org
DOI: 10.9790/5728-11642632 www.iosrjournals.org 26 | Page
Equi independent equitable domination number of cycle and
bistar related graphs
S K Vaidya1
, N J Kothari2
1
(Department of Mathematics, Saurashtra University Rajkot - 360005, Gujarat, INDIA.)
2
(L. E. College, Morbi - 363642, Gujarat, India.)
Abstract : A subset D of ( )V G is called an equitable dominating set if for every ( )v V G D  there exists a
vertex u D such that ( )uv E G and | ( ) ( ) | 1deg u deg v  . A subset D of ( )V G is called an equitable
independent set if for any ,u D v  ( )e
N u for all { }v D u  . The concept of equi independent equitable
domination is a combination of these two important concepts. An equitable dominating set D is said to be equi
independent equitable dominating set if it is an equitable independent set. The minimum cardinality of an equi
independent equitable dominating set is called equi independent equitable domination number which is denoted
by e
i . We investigate equi independent equitable domination number of some cycle and bistar related graphs.
Some graph families whose equitable domination number is equal to its equi independent equitable domination
number are also reported.
Keywords: Domination number, equitable domination number, equi independent equitable domination
number.
AMS Subject Classification (2010): 05C38,05C69,05C76.
I. Introduction
We begin with simple, finite, connected and undirected graph G with vertex set ( )V G and edge set
( )E G . For standard graph theoretic terminology we follow Harary [1] while the terms related to the theory of
domination are used here in the sense of Haynes et al. [2]. A set ( )D V G is called a dominating set if every
vertex in ( )V G D is adjacent to at least one vertex in D . The domination number ( )G is the minimum
cardinality of a dominating set of G . A subset D of ( )V G is an independent set if no two vertices in D are
adjacent. A dominating set D which is also an independent set is called an independent dominating set. The
independent domination number ( )i G is the minimum cardinality of an independent dominating set. The
concept of independent domination was formalized by Berge [3], Ore [4], Cockayne and Hedetniemi [5,6]. A
brief survey on independent domination is carried out in recent past by Goddard and Henning [7]. A subset D
of ( )V G is called an equitable dominating set if for every ( )v V G D  there exists a vertex u D such that
( )uv E G and | ( ) ( ) | 1deg u deg v  . The minimum cardinality of an equitable dominating set is equitable
domination number of G which is denoted by e
 . This concept was conceived by E. Sampathkumar.
Definition 1.1: For every vertex ( )v V G the open neighbourhood set ( )N v is the set of all vertices adjacent
to v in G . That is, ( ) { ( ) / ( )}N v u V G uv E G   .
Definition 1.2: The closed neighbourhood set [ ]N v of v is defined as [ ] ( ) { }N v N v v  .
Definition 1.3: A vertex v D is an isolate of D if ( ) ( )N v V G D  .
Definition 1.4: A vertex ( )u V G is degree equitably adjacent or equitable adjacent with a vertex ( )v V G if
| ( ) ( ) | 1deg u deg v  for ( )uv E G .
Definition 1.5: A vertex ( )v V G is called equitable isolate if | ( ) ( ) | 2deg u deg v  for every ( )u N v .
Definition 1.6: The equitable neighbourhood of v denoted by ( )e
N v is defined as ( )e
N v 
{ ( ) / ( ),| ( ) ( ) | 1}u V G u N v deg v deg u    .
The following concept known as equitable independent set was introduced by Swaminathan and
Dharamlingam [8].
Definition 1.7: A subset D of ( )V G is called an equitable independent set if for any ,u D v  ( )e
N u for all
{ }v D u  . The maximum cardinality of an equitable independent set is denoted by ( ).e
G

Equi independent equitable domination number of cycle and bistar related graphs
Remark 1.8: Every independent set is an equitable independent set.
Motivated through the concept of equitable dominating set and equitable independent set a new
concept was conceived by Swaminathan and Dharamlingam [8]. This concept was formalized and named as
equi independent equitable dominating set by Vaidya and Kothari [9,10,11].
Definition 1.9: An equitable dominating set D is said to be equi independent equitable dominating set if it is an
equitable independent set. The minimum cardinality of an equi independent equitable dominating set is called
equi independent equitable domination number which is denoted by
e
i .
Illustration 1.10: In figure 1, 1 2 3 5 7 9{ , , , , , }D v v v v v v is equitable independent set as well as equitable
dominating set for graph G .
Figure 1
Definition 1.11: For a graph G the splitting graph ( )S G of a graph G is obtained by adding a new vertex v
corresponding to each vertex v of G such that ( ) ( )N v N v .
Definition 1.12: The total graph ( )T G of a graph G is the graph whose vertex set is ( ) ( )V G E G and two
vertices are adjacent whenever they are either adjacent or incident in G .
Definition 1.13: The shadow graph 2 ( )D G of a connected graph G is constructed by taking two copies of G
say G and G . Join each vertex u in G to the neighbours of the corresponding vertex u in G .
Definition 1.14: The middle graph ( )M G of a graph G is the graph whose vertex set is ( ) ( )V G E G and in
which two vertices are adjacent if and only if either they are adjacent edges of G or one is a vertex of G and
the other is an edge incident on it.
Definition 1.15:[12] Duplication of a vertex iv by a new edge i ie v v  in graph G produces a new graph G
such that ( ) ( ) { }i i iN v N v v   .
Definition 1.16: The graph 1,nK is called a star. It is the graph with 1n  vertices – a vertex of degree n called
the apex and n pendant vertices.
Definition 1.17: Bistar is the graph obtained by joining the apex vertices of two copies of star 1,nK .
II. Main results
Theorem 2.1: ( ( )) ( ( )) ( ) .e e
n n ni S C S C C n    
Proof: Let 1 2, ,..., nv v v be the vertices of path nP and 1 2, , , nu u u be the corresponding vertices which are
added to obtain ( )nS C . Here ( ) 2, ( ) 4i id u d v  and vertex iu is not adjacent to any other vertex ju . This
implies that vertices 'iu s are equitable isolates. Therefore they must belong to every equitable dominating set
of ( )nS C . While subgraph induced by 1 2( ( )) { , , , }n nV S C u u u   is cycle nC . Which implies that
( ( )) ( )e e
n nS C C n   
Now consider a set which satisfies above lower bound as 1 2{ , , , }nD S u u u  where S is an equitable
dominating set of nC . Observe that D is an equitable dominating set of ( )nS C as 1 2, , , nu u u are equitable
isolates and other vertices are equitably dominated by set S . This implies that
( ( )) ( ) ( )e e
n n nS C C n C n      

Also D is an equitable independent as vertices of S are not adjacent to each other and 1 2, , , nu u u
are equitable isolates. Hence D is an equi independent equitable dominating set of ( )nS C and
( ( )) ( ( )) ( ( ))e e
n n ni S C S C S C n      .
Theorem 2.2:   
 
 
2
0 mod 5
5
2
0 mod 5
5
n
n
n
T C
n
n



 
    
Proof: Let 1 2, , , nv v v be the vertices of nC and 1 2, , , ne e e be the edges of nC . Then 1 2( ( )) { , , ,nV T C v v 
1 2, , , , }n nv e e e and | ( ( )) | 2nV T C n . Observe that ( )nT C is four regular graph. Therefore every vertex can
dominate five vertices including itself. Which implies that
2
( ( ))
5
n
n
T C
 
  
 
Now depending upon the number of vertices of nC , consider following subsets of ( )nT C .
For 0 (mod 5)n  , 5 1 5 3, /0 ,0
5 5
i j
n n
D v u i j 
 
     
 
with
2
| |
5
n
D  ,
for 1,2 (mod 5)n  , 5 1 5 3, /0 ,0
5 5
i j
n n
D v u i j 
    
        
    
with
2
| |
5
n
D
 
  
 
,
for 3,4 (mod 5)n  , 5 1 5 3, /0 ,0
5 5
i j
n n
D v u i j 
    
        
    
with
2
| |
5
n
D
 
  
 
.
Here    5 1 5 5 2 5 5 1, , ,i i i i iN v v v u u   and    5 3 5 4 5 4 5 2 5 4, , ,i i i i iN u v v u u     . This implies that
    nN D V T C . Then D is dominating set of  nT C and   
 
 
2
0 mod 5
5
2
0 mod 5
5
n
n
n
T C
n
n



 
    
.
Theorem 2.3: ( ( )) ( ( )) ( ( ))e e
n n ni T C T C T C  
Proof: To prove this result we continue with the terminology and notations used in Theorem 2.2. Here ( )nT C
is a four regular graph. This implies that
( ( )) ( ( ))e
n nT C T C 
Now consider D as  -set of ( )nT C , as given in Theorem 2.2. Observe that vertices of D are not
adjacent to each other. Then D is an independent set of ( )nT C consequently D is an equitable independent set
of ( )nT C . Hence D is an equi independent equitable dominating set of ( )nT C and ( ( ) ))( ()e
n n
e
i TT C C
( ( ))nT C
Theorem 2.4:      2 2
for 0 (mod 4)
2
for 1,3 (mod 4)
2
1 for 2 (mod 4)
2
e
n n
n
n
n
D C D C n
n
n
 



 
   
 

 

Proof: Consider two copies of nC . Let 1 2, , , nv v v be the vertices of first copy of nC and 1 2, , , nu u u be the
vertices of second copy of nC . Then 2| ( ) | 2nD C n . Observe that 2 ( )nD C is four regular graph. This implies
that minimum
2
4 2
n n
 vertices are essential to dominate 2( ( ))nV D C and
2 2( ( )) ( ( ))
2
e
n n
n
D C D C  
Now depending upon the number of vertices of nC , consider following subsets of   2 nV D C ,

For 0 (mod 4)n  4 1 4 2, / 0
4
i i
n
D v u i 
 
   
 
,
for 1 (mod 4)n  4 1 4 2, / 0 ,0
4 4
i j
n n
D v u i j 
    
        
    
,
for 2,3 (mod 4)n  4 1 4 2, / 0
4
i i
n
D v u i 
  
    
  
.
Here    4 1 4 4 2 4 4 2, , ,i i i i iN v v v u u   and    4 2 4 1 4 3 4 1 4 3, , ,i i i i iN u v v u u     . Therefore 2[ ] ( ( ))nN D V D C . Thus
D is dominating set as well as equitable dominating set of  2 nD C and
2 2
for 0 (mod 4)
2
( ( )) ( ( )) for 1,3 (mod 4)
2
1 for 2 (mod 4)
2
e
n n
n
n
n
D C D C n
n
n
 



 
   
 

 

Theorem 2.5:
 
 
 
2
2
for 0 mod 3
3
2
( ( )) 1 for 1 mod 3
3
2
1 for 2 mod 3
3
e
n
n
n
n
i D C n
n
n



 
   
 
 
  
 
Proof: To prove this result we continue with the terminology and notations used in Theorem 2.4. Observe that
vertex iv cannot dominate iu and vice versa. On other hand vertex iv is adjacent to all the vertices of  iN u
and vertex iu is adjacent to all the vertices of  iN v . This implies that if vertex iv belongs to any equitable
independent set of  2 nD C then iu must belong to that equitable independent set. Therefore
2 2( ( )) ( ( ))n n
e e
i D C D C
Now depending upon the number of vertices of nC , consider following subsets of 2( ( ))nV D C ,
For  0 mod 3n  3 1 3 1, / 0
3
i i
n
D v u i 
 
   
 
,
for  1 mod 3n  3 1 3 1 1 1, , , / 0
3
i i n n
n
D v u v u i   
  
    
  
,
for  2 mod 3n  3 1 3 1, / 0
3
i i
n
D v u i 
  
    
  
.
Here    3 1 3 3 2 3 3 2, , ,i i i i iN v v v u u   and    3 1 3 3 2 3 3 2, , ,i i i i iN u v v u u   . This implies that vertices 3 1iv 
and 3 1iu  are not adjacent to each other. Therefore D is an independent set of  2 nD C . Consequently D is an
equitable independent set of  2 nD C . Also e
N 2[ ] ( ( ))nD V D C implies that D is an equitable dominating set
of  2 nD C . Hence D is an equi independent equitable dominating set of  2 nD C and
 
 
 
2
2
for 0 mod 3
3
2
( ( )) 1 for 1 mod 3
3
2
1 for 2 mod 3
3
e
n
n
n
n
i D C n
n
n



 
   
 
 
  
 
Theorem 2.6: ( ( )) ( ( )) ( ) .e e
n n ni M C M C C n   

Proof: Let 1 2, , , nv v v be the vertices of nC and 1 2, , , ne e e be the edges of nC . Then 1 2( ( )) { , ,nV M C v v
1 2, , , , , }n nv e e e  . Here ( ) 4, ( ) 2i id e d v  in ( )nM C and vertices iv are not adjacent to each other. Then
vertices 1 2, , , nvv v are equitable isolates. Therefore they must belong to every equitable dominating set of
( )nM C . While subgraph induced by 1 2( ( )) { , , , }n nV M C v v v  is cycle nC . This implies that
      e e
n nn n C nM CC     
Now consider a set which satisfies above lower bound as 1 2{ , , , }nD S v v v  where S is an equitable
dominating set of nC . Observe that D is an equitable dominating set of ( )nM C as 1 2, , , nv v v are equitable
isolates and other vertices are equitably dominated by set S . This implies that
( ( )) ( ) ( )e e
n n nM C C n C n     
Also D is an equitable independent as vertices of S are not adjacent to each other and 1 2, , , nv v v are
equitable isolates. Hence D is an equi independent equitable dominating set of ( )nM C and
( ( )) ( ( ))e e
n ni M C M C  ( ( ))nM C n  .
Theorem 2.7: The graph obtained by duplication of each vertex of nC by an edge then
( ) ( ) ( )e e
ni G G C n   
Proof: Let 1 2, , , nv v v be the vertices of nC and G be a obtained by duplication of each vertex iv of nC by an
edge 1i iu u  . Then 1 2 1 2 2( ) { , , , , , , , }n nV G v v v u u u   . Here vertices 2 1iu  and 2iu are equitably adjacent to each
other but they are not equitably adjacent to vertex iv . Therefore at least one vertex from 2 1 2{ , }i iu u must belong
to every equitable dominating set of G . While subgraph induced by 1 2 2( ) { , , , }nV G u u u  is cycle nC . This
implies that
( ) ( ) ( )e e
n nG C n C n     
Now consider a set which satisfies above lower bound as 1 2 2{ , , , }nD S u u u  , where S is e
  set
of nC . Then D is an equitable dominating set of G , as vertices 1 2 2, , , nu u u are equitable isolates and
remaining vertices are dominated by set S . This implies that
( ) ( ) ( )e e
n nG C n C n     
Also D is an equitable independent set as vertices 1 2 2, , , nu u u are equitably non adjacent to vertices of S and
vertices of S are not adjacent to each other. Hence D is an equi independent equitable dominating set of G
and ( ) ( ) ( )e e
ni G G C n    .
Theorem 2.8: 2 2
, ,
1 for 2
( ) ( )
3 for 3
e
n n n n
n
i B B
n


  

Proof: Consider ,n nB with vertex set { , , , }i iu v u v where ,u v are apex vertices and ,i iu v are pendant vertices.
Then 2
, ,( ) ( )n n n nV B V B and 2
, ,( ) ( ) { , , , /1 , , , }n n n n i j i i j iE B E B u u u v v v v u i j n i j    . Note that ( ) ( )i id u d v 
1n  and ( ) ( ) 2 1d u d v n   .
Case 1: 2n 
In this case vertex u is equitably adjacent to all the vertices. Hence 2 2
, ,( ) ( ) 1e e
n n n ni B B  .
Case 2: 3n 
Here vertex iu is equitably adjacent to all the vertices ju where i j and similarly vertex iv is
equitably adjacent to all the vertices jv where i j . Therefore one vertex from 'iu s say 1u and one vertex
from 'iv s say 1v must belong to every equitable dominating set of 2
,n nB . While vertex u is equitably adjacent
to v only. This implies that
2
,( ) 3e
n nB 
Now consider a set which satisfies above lower bound as 1 1{ , , }D u u v . Here 1 1( ) ( ) ( )e e e
N u N u N v 
2
,( )n nV B . Therefore D is an equitable dominating set of 2
,n nB and 2
,( ) 3e
n nB  . Also vertices 1,u u and 1v

are not equitably adjacent to each other. This implies that D is an equitable independent set of 2
,n nB . Hence D
is an equi independent equitable dominating set of 2
,n nB and 2 2
, ,( ) ( ) 3e e
n n n ni B B  .
Theorem 2.9: 2 , 2 ,( ( )) ( ( )) 4 2e e
n n n ni D B D B n  
Proof: Consider two copies of ,n nB . Let { , , , /1 }i iA u v u v i n   and { , , , /1 }i iB u v u v i n      be the
corresponding vertex sets of each copy of ,n nB . Then 2 ,( ( ))n nV D B A B  and 2 ,( ( )) { , , ,n n i i iE D B uu uu u u 
, , , , , , , , }i i i i iu u vv vv v v v v uv uv v u v u          . Note that ( ) ( ) ( ) ( ) 2i i i id u d u d v d v     , ( ) ( ) ( ) ( )d u d u d v d v   
2 2n  and vertices , , ,i i i iu u v v  are not adjacent to each other. This implies that vertices , , ,i i i iu v u v  are note
adjacent to each other. Then vertices , , ,i i i iu v u v  are equitable isolates. Therefore they must belong to every
equitable dominating set of 2 ,( )n nD B . While rest of vertices , , ,u u v v  can be equitably dominate by either ,u u
or ,v v . This implies that
2 ,( ( )) 4 2e
n nD B n  
Now consider a set which satisfies above lower bound as
1 2 1 2 1 2 1 2{ , , , , , , , , , , , , , , ,n n n nD u u u v v v u u u v v v          , }u u . Then 2 ,[ ] ( ( ))e
n nN D V D B with | | 4 2D n  .
Therefore 2 ,( ( )) 4 2e
n nD B n   . While vertices of D other than ,u u are equitable isolates and ,u u are not
adjacent to each other. This implies that D is an equitable independent set of 2 ,( )n nD B . Hence D is an equi
independent equitable dominating set of 2 ,( )n nD B and 2 , 2 ,( ( )) ( ( )) 4 2e e
n n n ni D B D B n   .
Theorem 2.10: , ,
3 for 2
( ( )) ( ( ))
4 3 for 3
e e
n n n n
n
i S B S B
n n


   
 
Proof: Consider ,n nB with vertex set { , , , /1 }i iu v u v i n  where ,i iu v are pendant vertices. In order to obtain
,( )n nS B add , , ,i iu v u v    vertices corresponding to , , ,i iu v u v , where 1 i n  .
Case 1: 2n 
In this case vertices 1 2 1 2, , ,u u v v    are equitable isolates. Therefore they must belong to every equitable
dominating set of 2,2( )S B . Observe that 1 2( ) { , , }e
N u u u v  , 1 2 1 2 1 2( ) { , , }, ( ) { , , , , },e e
N v v v u N u u u u u v   
1 2 1 2( ) { , , , , }e
N v v v v v u  . From this consider 1 2 1 2{ , , , , , , }D u u v u u v v      . Then 2,2[ ] ( ( ))e
N D V S B . Therefore
D is an equitable dominating set of 2,2( )S B and 2,2( ( )) 7e
S B   . While vertices 1 2 1 2, , ,u u v v    are equitable
isolates and other vertices , ,u v u  are note equitably adjacent to each other. This implies that D is an equitable
independent set of 2,2( )S B . Hence D is an equi independent equitable dominating set of 2,2( )S B and
2,2 2,2( ( )) ( ( )) 7e e
i S B S B   .
Case 2: 3n 
In this case ( ) ( ) 1i id u d v   , ( ) ( ) 1d u d v n    , ( ) ( ) 2i id u d v  , ( ) ( ) 2 2d u d v n   . Note
that vertices ,i iu v are not adjacent to each other and not adjacent to ,i iu v  . Then vertices , , , , ,i i i iu v u v u v    are
equitable isolates. Therefore they must belong to every equitable dominating set of ,( )n nS B . While remaining
vertices u and v are equitably adjacent to each other. Therefore at least one vertex from { , }u v must belong to
every equitable dominating set of ,( )n nS B . This implies that
,( ( )) 4 3e
n nS B n   
Now consider a set which satisfies above lower bound as { , , , , , , /1 }i i i iD u v u v u v u i n      with| | 4 3D n  .
Here
e
N ,[ ] ( ( ))n nD V S B . Therefore D is an equitable dominating set of ,( )n nS B . Also D is an equitable
independent set as all the vertices of D other than u are equitable isolates. Hence D is an equi independent
equitable dominating set of ,( )n nS B and , ,( ( )) ( ( )) 4 3e e
n n n ni S B S B n    .
III. Conclusion
The equi independent equitable dominating set is a combination of two concepts – equitable
dominating set and equitable independent set. We derive equi independent equitable domination number of
some cycle and bistar related graphs

References
[1] F. Harary, Graph Theory (Addison Wesley, Massachusetts, 1972).
[2] T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of domination in graphs (Marcel Dekker, New York, 1998).
[3] C. Berge, Theory of Graphs and its Applications (Methuen, London, 1962).
[4] O. Ore, Theory of graphs, Amer. Math. Soc. Transl. 38, (1962), 206-212.
[5] E. J. Cockayne and S.T. Hedetniemi, Independence graphs, Congr. Numer., X, (1974), 471-491.
[6] E. J. Cockayne and S.T. Hedetniemi, Towards a theory of domination in graphs, Networks, 7, (1977), 247-261.
[7] W. Goddard and M. A. Henning, Independent domination in graphs: A survey and recent results, Discrete Mathematics, 313,
(2013), 839-854.
[8] V. Swaminathan and K. M. Dharmalingam, Degree equitable domination on graphs, Kragujevac Journal of Mathematics, 35(1),
(2011), 191-197.
[9] S. K. Vaidya and N. J. Kothari, Equi independent equitable dominating sets in graphs (Accepted for publication in Proyecciones
Journal of Mathematics).
[10] S. K. Vaidya and N. J. Kothari, Some Results on Equi Independent Equitable Dominating Sets in Graphs, Journal of Scientific
Research, 7(3), (2015), 77-85.
[11] S. K. Vaidya and N. J. Kothari, On equi independent equitable dominating sets in graphs (Accepted for publication in International
Journal of Mathematics and Soft Comuting).
[12] S.K.Vaidya and Lekha Bijukumar, Some New Families of Mean Graphs, Journal of Mathematics Research, 2(3), 2010, 169-176.

Equi independent equitable domination number of cycle and bistar related graphs

More Related Content

What's hot (20)

Similar to Equi independent equitable domination number of cycle and bistar related graphs (20)

More from iosrjce (20)

Recently uploaded (20)

Equi independent equitable domination number of cycle and bistar related graphs