See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/326052241

Medium Domination Number of Certain Graphs

Article · June 2018

DOI: 10.23956/ijermt.v6i11.55

CITATION READS

1 402

2 authors:

Uma Samundesvari J. Maria Regila Baby

Noorul Islam University Noorul Islam Centre For Higher Education, Kumaracoil, India
12 PUBLICATIONS   9 CITATIONS    4 PUBLICATIONS   1 CITATION   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

edge to vertex detour moophonic View project

All content following this page was uploaded by Uma Samundesvari on 18 September 2018.

The user has requested enhancement of the downloaded file.

International Journal of Emerging Research in
Management &Technology ISSN: 2278-9359 Research Article November
(Volume-6, Issue-11) 2017

Medium Domination Number of Certain Graphs

K. Uma Samundesvari, J. Maria Regila Baby
Mathematics, Noorul Islam University, Kumaracoil,
TamilNadu, India

Abstract –

In this paper the author have found out the medium domination number of Helm graph, Friendship graph.

Keywords − Dominating set, minimum dominating set, domination number, total domination number,
medium domination number.

I. INTRODUCTION
A set S of nodes of G is a dominating set of G if each node of G is dominated by some node in S. If Sis
a dominating set of a graph G and no proper subset of G is a dominating set of G, then S is called a minimum
dominating set. A minimum dominating set in a graph G is a dominating set of minimum number. The number
of a minimum dominating set is called the domination number of G and is denoted by 𝛾(𝐺). The total
domination number of G, denoted as 𝛾𝑡 (𝐺) is the cardinality of the smallest total dominating set of G. For G =
(V, E) and for every x, y ∈ V if x and y are adjacent they dominate each other then dom(x, y) ≥ 1. In any graph G
= (V, E) and for every x, y ∈ V, the total dominating number of nodes is denoted as
𝑇𝐷𝑉(𝐺) = ∀𝑥,𝑦∈𝑉 𝑑𝑜𝑚(𝑥, 𝑦).

Example: 1.1
For the graph G given below,
dom(𝑣1 , 𝑣2 ) = 1, dom(𝑣1, 𝑣3 ) = 2, dom(𝑣1 , 𝑢) = 1, dom(𝑣1, 𝑣4 ) = 1,
dom(𝑣2, 𝑣3 ) = 1, dom(𝑣2 , 𝑣4 ) = 2 , dom(𝑣2 , 𝑢) = 1, dom(𝑣3 , 𝑣4 ) = 1,
dom(𝑣3 , 𝑢) = 1, dom(𝑣4 , 𝑢) = 0 .
𝑇𝐷𝑉( 𝐺 ) = 1+2+1+1+1+2+1+1+1+0 = 11.

Figure 1.1

II. MEDIUM DOMINATION NUMBER

Definition: 2.1
In any connected simple graph G of order p, the medium domination number of G is defined as
𝑇𝐷𝑉 𝐺
𝛾𝑚 𝐺 = .
𝑝𝐶2

© www.ermt.net All Rights Reserved Page | 130

 Samundesvari et al., International Journal of Emerging Research in Management &Technology
ISSN: 2278-9359 (Volume-6, Issue-11)
Example: 2.2
For the graph G given above,
Total Domination number T DV (G) = 11
11 11
Medium domination number 𝛾𝑚 (G) =5𝐶 = 10
2

Observation: 2.3
Let G be a graph with p nodes, q edges and fordeg 𝑣𝑖 ≥ 2; 𝑇𝐷𝑉 𝐺 = 𝑞 + 𝑣𝑖 ∈𝑉 𝑑𝑒𝑔𝑣𝑖 𝐶2 .

Theorem: 2.4
8𝑛+6+ 𝑛𝑖=4 𝑖
For a Helm graph 𝐻𝑛 , 𝛾𝑚 𝐻𝑛 = ,𝑛≥3.
(2𝑛+1)𝐶2

Proof. The Helm graph 𝐻𝑛 has 2n+1 nodes and 3n edges.

8𝑛+6+ 𝑛𝑖=4 𝑖
Let 𝑃 𝑛 = .
(2𝑛+1)𝐶2
We prove this theorem by the method of induction.
Basis Step :P (3) is true.
H3 contains seven nodes namely, v1, v2, v3, u1, u2, u3, u with u as a middle node and nine edges v1v2, v1v3, v2v3,
v1u, v2u, v3u, u1v1, u2v2, u3v3 .u is adjacent to three nodes v1, v2 and v3 . Here the three nodes v1, v2 and v3 are of
even degree and other nodes are of odd degree. The total number of nodes that dominate each couple of nodes
is the sum of number of edges and the summation of deg𝑣𝑖 𝐶2 .
TDV( G ) is split-up into three parts, namely the number of edges, the odd degree nodes and the even degree
nodes. By 2.3,

𝑇𝐷𝑉 𝐺 = 𝑞 + 𝑑𝑒𝑔𝑣𝑖 𝐶2 .
𝑣 𝑖 ∈𝑉

Now 𝑇𝐷𝑉 𝐻3 = 𝑞 + 𝑜𝑑𝑑 𝑣 𝑖 (𝑑𝑒𝑔𝑣𝑖 𝐶2 ) + 𝑒𝑣𝑒𝑛 𝑣 𝑖 (𝑑𝑒𝑔𝑣𝑖 𝐶2 )

= 9 + 1 3𝐶2 + 3 4𝐶2 = 9+3+18 = 30

Therefore
𝑇𝐷𝑉(𝐻3 )
𝛾𝑚 𝐻3 =
(2𝑛+1)𝐶2

30 30
= =
(2×3+1)𝐶2 7𝐶2

Induction Step: Assume P (𝑛 − 1) is true.

Let us take the Helm graph 𝐻𝑛 −1 , 𝑛 > 3 .

𝐻𝑛 −1 has 2𝑛 − 1 nodes u,𝑣1 ,𝑣2 , 𝑣3 , … , 𝑣𝑛−1 , 𝑢1 , 𝑢2 , … , 𝑢𝑛−1 and 3 𝑛−1 edges,

𝑣1 𝑣2 , 𝑣2 𝑣3 , … , 𝑣2𝑛−2 𝑣2𝑛−1 , 𝑣1 𝑢𝑖 , 1 ≤ 𝑖 ≤ 𝑛 − 1 and 𝑢𝑣𝑖 , 1 ≤ 𝑖 ≤ 𝑛 − 1 . In 𝐻𝑛 −1 , both odd and even
degree nodes are ( 𝑛 − 1 ) and middle node 𝑢 has degree ( 𝑛 − 1 ).

The total number of nodes that dominates each couple of nodes is

𝑛 −1

𝑇𝐷𝑉 𝐻𝑛 −1 = 8 𝑛 − 1 + 6 + 𝑖
𝑖 =4
To prove 𝑃 (𝑛) is true.

Consider the Helm graph 𝐻𝑛 .

© www.ermt.net All Rights Reserved Page | 131

 Samundesvari et al., International Journal of Emerging Research in Management &Technology
ISSN: 2278-9359 (Volume-6, Issue-11)
Here 𝐻𝑛 has 2𝑛 + 1 nodes 𝑢,𝑣1 , 𝑣2 , 𝑣3 , … , 𝑣𝑛 , 𝑢1 , 𝑢2 , … , 𝑢𝑛 and 3𝑛 edges 𝑣1 𝑣2 , 𝑣2 𝑣3 , … , 𝑣𝑛−1 𝑣𝑛 , 𝑣𝑖 𝑢𝑖 , 1 ≤
𝑖 ≤ 𝑛 and 𝑢𝑣𝑖 , 1 ≤ 𝑖 ≤ 𝑛 . In 𝐻𝑛 , the number of both even and odd degree nodes are 𝑛 and middle node 𝑢
has degree 𝑛 . By the graphs 𝐻3 and 𝐻𝑛−1 comparisons, for each (𝑛 − 1) stage to 𝑛𝑡ℎ stage, it was found that
two additional nodes and 3 edges are included.

Therefore the total number of nodes and edges added in the next stage will be
3 + 1(4C2) + {𝑛C2 − (𝑛 − 1)C2}.

Therefore

𝑇𝐷𝑉 (𝐻𝑛 ) = 𝑇 𝐷𝑉 (𝐻𝑛−1 ) + 3 + 4𝐶2 + {𝑛𝐶2 − (𝑛 − 1)𝐶2 } .

𝑛−1 𝑛(𝑛−1) (𝑛−1)(𝑛−2)

=8 𝑛−1 +6+ 𝑖=4 𝑖 +3+6+ −
2 2

𝑛 −1
= 8𝑛 − 2 + 𝑖=4 𝑖 +9+𝑛−1

𝑛 −1
= 8𝑛 + 6 + 𝑖=4 𝑖 −𝑛+𝑛

𝑛 −1
𝑇𝐷𝑉 𝐻𝑛 = 8𝑛 + 6 + 𝑖=4 𝑖

𝑇𝐷𝑉 (𝐻𝑛 )
𝛾𝑚 𝐻𝑛 =
(2𝑛 +1)𝐶2

8𝑛 +6+ 𝑛𝑖=4
−1
𝑖
𝛾𝑚 𝐻𝑛 = , 𝑛 ≥ 3.
(2𝑛+1)𝐶2

Theorem: 2.5
2𝑛 2 +4𝑛
For a Friendship graph 𝐹𝑛 , 𝛾𝑚 𝐹𝑛 = , where 𝑛 is the number of triangles .
(2𝑛+1)𝐶2

Proof. The Friendship graph 𝐹𝑛 has 2𝑛 + 1 nodes and 3𝑛 edges. Let 𝑢 be the middle node and
𝑣1 , 𝑣2 , … , 𝑣2𝑛 be the remaining nodes of 𝐹𝑛 .
2𝑛 2 +4𝑛
Let 𝑃 𝑛 = .
(2𝑛 +1)𝐶2
We prove this theorem by the method of induction.

Basis Step :P (3) is true.

In 𝐹2 , there are five nodes v1, v2, v3, v4, u and six edges 𝑣2 , 𝑣2 𝑢, 𝑣1 𝑢, 𝑣3 𝑣4 , 𝑣3 𝑢,
𝑣4 𝑢. The middle node 𝑢 is adjacent to other nodes 𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 . Here all nodes are of even degree. The total
number of nodes that dominate each couple of nodes is the sum of number of edges and the summation of
deg𝑣𝑖 𝐶2 .

𝑇𝐷𝑉( 𝐺 )is split-up into three parts, namely the number of edges, the odd degree nodes and the even degree
nodes. By 2.3,
𝑇𝐷𝑉 𝐺 = 𝑞 + 𝑑𝑒𝑔𝑣𝑖 𝐶2 .
𝑣𝑖 ∈𝑉

Now
𝑇𝐷𝑉 𝐹2 = 𝑞 + (𝑑𝑒𝑔𝑣𝑖 𝐶2 ) + (𝑑𝑒𝑔𝑣𝑖 𝐶2 )
𝑜𝑑𝑑 𝑣 𝑖 𝑒𝑣𝑒𝑛 𝑣𝑖

© www.ermt.net All Rights Reserved Page | 132

 Samundesvari et al., International Journal of Emerging Research in Management &Technology
ISSN: 2278-9359 (Volume-6, Issue-11)
=𝑞+ (𝑑𝑒𝑔𝑣𝑖 𝐶2 ) [𝑠𝑖𝑛𝑐𝑒 (𝑑𝑒𝑔𝑣𝑖 𝐶2 ) ]
𝑒𝑣𝑒𝑛 𝑣 𝑖 𝑜𝑑𝑑 𝑣 𝑖
= 6 + 6 2𝐶2 = 12

Therefore
𝑇𝐷𝑉 (𝐹2 ) 12 12
𝛾𝑚 𝐹2 = = =
(2𝑛+1)𝐶2 (2×3+1)𝐶2 5𝐶2

Induction Step: Assume P (𝑛 − 1) is true.

𝐹𝑛−1 has 2𝑛 − 1 nodes u,𝑣1 ,𝑣2 , 𝑣3 , … , 𝑢2𝑛−2 and 3 𝑛 − 1 edges, 𝑣1 𝑣2 , 𝑣3 𝑣4 , … , 𝑣2𝑛−3 𝑣2𝑛−2 , 𝑣𝑖 𝑢,
1 ≤ 𝑖 ≤ 2𝑛 − 1. In 𝐹𝑛−1 there are (2𝑛 − 2)nodes are of even degree and middle node 𝑢 of degree ( 2𝑛 −
2 ).
The total number of nodes that dominates each couple of nodes is 𝑇𝐷𝑉 𝐹𝑛−1 = 2(𝑛 − 1)2 + 4(𝑛 − 1)
To prove 𝑃 (𝑛) is true.
Here 𝐹𝑛 has 2𝑛 + 1 nodes 𝑣1 , 𝑣2 , … , 𝑣2𝑛 , 𝑢 and 3𝑛 edges 𝑣1 𝑣2 , 𝑣3 𝑣4 , … , 𝑣2𝑛−1 𝑣2𝑛 , 𝑣𝑖 𝑢,
1 ≤ 𝑖 ≤ 2𝑛. In 𝐹𝑛 , there are 2𝑛 nodes are of even degree and middle node 𝑢 of degree 2𝑛 . By the graphs 𝐹2
and 𝐹𝑛−1 comparisons, for each (𝑛 − 1) stage to 𝑛𝑡ℎ stage, it was found that two additional nodes and 3 edges
are included.
Therefore the total number of nodes and edges added in the next stage will be 3 + 2(2C2) + {2𝑛C2 − (2𝑛 −
2)C2}.
Therefore

𝑇𝐷𝑉 (𝐹𝑛 ) = 𝑇𝐷𝑉 (𝐹𝑛−1 ) + 3 + 2(2𝐶2 ) + {2𝑛𝐶2 − (2𝑛 − 2)𝐶2 } .

2𝑛 (2𝑛−1) (2𝑛−2)(2𝑛−3)
= 2(𝑛 − 1)2 + 4 𝑛 − 1 + 5 + −
2 2

= 2𝑛2 + 3 + 4𝑛 − 3 = 2𝑛2 + 4𝑛

𝑇𝐷𝑉 (𝐹𝑛 )
𝛾𝑚 𝐹𝑛 =
(2𝑛 +1)𝐶2

2𝑛 2 +4𝑛
𝛾𝑚 𝐹𝑛 = .
(2𝑛+1)𝐶2

III. CONCLUSION
In this paper, the author have studied about Medium Domination Number of certain graphs like Helm,
Friendship graphs.

ACKNOWLEDGEMENT
The authors are thankful to the reviewers for their valuable suggestions and comments.

REFERENCES
[1] . Anitha.K and L.JethruthEmelda Mary, “The Medium Domination Number of a Graph”, Vol : 03, 857-
860 , International Journal of Com-puting Algorithm, 2014.
[2] . Bondy.J.A and Murty.U.S.R, “Graph Theory with Application”, North - Holland , New York.
[3] . Dundar.P and N.Tacmin, “Domination and Total Domination Number of a Graphs ”, Master thesis,
Faculty of Science, Ege University, 2006.
[4] . DuyguVargor and Pinar Dundar, “The Medium Domination Number of a Graph ”, International
Journal of Pure and Applied Mathematics Vol: 70, No: 3, 297-306, 2011.

© www.ermt.net All Rights Reserved Page | 133

 Samundesvari et al., International Journal of Emerging Research in Management &Technology
ISSN: 2278-9359 (Volume-6, Issue-11)
[5] . Parvathi.N and Ramachandran.M, “The Medium Domination Number of a Jahangir Graph J 2,m ”,
National Conference on Mathematical Techniques and its Applications(NCMTA), Chennai:SRM
University,2014.
[6] . Ramachandran.M and N.Parvathi, “The Medium Domination Number of a Graph J m,n ,” Indian
Journal of science and Technology, Vol 8(5), 400-406, 2015.
[7] . Vargor.D and P.Dundar, “The Medium Domination Number of a Graph,” Int. J. pure Appl. Math. Sci.
70: 297-306, 2011.

© www.ermt.net All Rights Reserved Page | 134

View publication stats