International Journal of Mathematics Trends and Technology
Volume 35 | Number 4 | Year 2016 | Article Id. IJMTT-V35P534 | DOI : https://doi.org/10.14445/22315373/IJMTT-V35P534
Let G= (V, E) be a graph. A Subset D of V is called a dominating set of G if every vertex in V-D is adjacent to atleast one vertex in D. The Domination number γ (G) of G is the cardinality of the minimum dominating set of G. Let G = (V, E ) be a graph and let f be a function that assigns to each vertex of V to a set of values from the set {1,2,.......k} that is, f:V(G) → {1,2,.....k} such that for each u,v V(G), f(u)≠f(v), if u is adjacent to v in G. Then the dominating set D V (G) is called a balanced dominating set if In this paper, we determine the balanced domination number for union of graphs.
[1] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
[2] B.Bresar, Tadeja Kraner Sumenjak, On the 2− rainbow domination in graphs, Discrete Applied Mathematics, 155(2007), 2394-2400.
[3] Henning, M. A. and S. T. Hedetniemi, Defending the Roman Empire–A new strategy, Discrete Mathematics 266, (2003), pp. 239–251.
[4] F. Haray, Graph Theory, Adison Wesley, reading Mass (1972).
[5] E.J. Cockayne, P.J.P. Grobler, W.R. Gründlingh, J. Munganga, and J.H. van Vuuren, Protection of a graph, Util. Math. 67 (2005) 19- 32.
[6] S. Christilda and P. Namasivayam, The Balanced Domination Number of Some Standard Graphs, Proceedings on Recent Trends in Mathematical Sciences (2015) 92 – 96.
[7] D.B. West, Introduction to Graph Theory (Prentice-Hall, Inc, 2000).
S.Christilda, P.Namasivayam, "Balanced Domination Number of Union of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 35, no. 4, pp. 228-232, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V35P534
PDF 
Abstract 
Keywords 
References 
Citation