Open Support Strong Efficient Domination Number of Some Standard Graphs Under Addition and Multiplication

Authors

  • Murugan K The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli
  • Meena The Madurai DiraviyamThayumanavar Hindu College, Tirunelveli Tamilnadu, India

Keywords:

Strong efficient domination number, Open support strong efficient domination number of a point under addition, open support strong efficient domination number of a graph under addition, open support strong efficient domination number of a point under multiplication and open support strong efficient domination number of a graph under multiplication

Abstract

Let G = (V, E) be a graph with p points and q nodes. Let S be a - set of G. Let v  S. An open support strong efficient domination number of v under addition is defined by  and it is denoted by supp An open support strong efficient domination number of G under addition is defined by  and it is denoted by supp . An open support strong efficient domination number of v under multiplication is defined by  and it is denoted by supp  An open support strong efficient domination number of G under multiplication is defined by  and it is denoted by supp  In this paper, open support strong efficient domination number of some standard graphs is studied.and the results are presented

Author Biography

Murugan K, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli

The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli, Tamil Nadu, India.

References

S.Balamurugan, M.Anitha, C.Karnan and P.Palanikumar, Open Support of a Graph Under Multiplication, International Journal of Mathematics Trends and Technology, Vol.65, Issue 5, (May 2019), 134-138.

S.Balamurugan, M.Anitha, P.Aristotle and C.Karnan, A Note on Open Support of a Graph Under Addition I, International Journal of Mathematics Trends and Technology, Vol.65, Issue 5, (May 2019), 110-114.

Bange. D.W, barkauskas.A.E. and Slater. P.J., Efficient dominating sets in graphs, Application of Discrete Mathematics, 189-199, SIAM, Philadelphia(1988).

Harary. F., Graph Theory, Addison – Wesley(1969).

F.Harary, T.W. Haynes and P.J. Slater, Efficient and excess domination in graphs, J.Combin. Math. Combin .Comput., 26(1998),83-95.

Haynes. T W., Stephen T.Hedetmiemi, PeterJ.Slater. Fundamentals of domination in graphs, Advanced Topics, Marce; Dekker,Inc, NewYork (1998).

Meena.N, Further Results on Sum of Strong Efficient Domination Number and Chromatic Number, International Journal of Innovative Science, Engineering & Technology, Vol. 3, Issue 11, (November 2016), 300-304.

Meena.N, Strong Efficient Domination Number of Inflated Graphs of Some Standard Graphs, International Journal of Scientific and Innovative Mathematical Research, Vol. 2, Issue 5, (May 2014), 435-440.

Meena.N, Subramanian.A, Swaminathan.V, Strong efficient domination and strong independent saturation number of graphs, International Journal of Mathematics and Soft Computing, Vol. 3, No. 2 (2013), 41-48

Meena.N, Subramanian.A, Swaminathan.V, Strong Efficient Domination in Graphs, International Journal of Innovative Science, Engineering & Technology, Vol. 1, Issue 4, (June 2014), 172-177.

Sampath Kumar.E and Pushpa Latha.L, Strong Weak domination and domination balance in a graph, Discrete Math., 161: (1996), 235 -242,

Published

2022-05-17