Volume 44 | Number 1 | Year 2017 | Article Id. IJMTT-V44P504 | DOI : https://doi.org/10.14445/22315373/IJMTT-V44P504
This paper, some result ϒ[BS(G)] were obtained in terms of vertices, edges and other different parameters of G. But not in terms of the numbers of BS(G). In addition, we establish the relationship of ϒ′[BS(G)] with other domination parameters of G. Also its relationship with other domination parameters were established.
[1] S.Arumugam and S.Ramachandran, Invitation of graph theory scitech publications(2001).
[2] S. Arumugam and S. Velammal, Edge domination in graphs, Taiwanese J. of Mathematics, 2(2), 173 – 179, 1998.
[3] R.Balakrishnan and K.Ranganathan , A text book of Graph theory, Springer international edition (2000).
[4] G. Chartrand and Ping Zhang, “Introduction to graph Theory”, Newyork (2006).
[5] Gary chartrand and Ping zhang, Introduction to graph theory, Tata McGraw – hill publishing company limited. New Delhi (2006).
[6] F.Harary, Graph Theory, Adison Wesley, Reading Mass (1972).
[7] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, Inc., New York, 1998).
[8] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, eds, Domination in Graph (Advanced Topics, Marcel Dekker, Inc., New York, 1998).
[9] F.Harary ,Graph theory, Narosa publishing house (1969)
[10] S.T.Hedetniemi and R.C.Laskar, Conneced domination in graphs, in B.Bollobas, editor, Graph Theory and Combinatorics, Academic Press, London, 209-218, 1984.
M.Karthiga, V.Revathi, "A Review on Domination Block Subdivision Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 44, no. 1, pp. 28-31, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V44P504