Volume 31 | Number 2 | Year 2016 | Article Id. IJMTT-V31P513 | DOI : https://doi.org/10.14445/22315373/IJMTT-V31P513
Let G = (V, E) be a simple graph. A dominating set D is called a complementary tree dominating set if the induced subgraph
[1] F. Harary, Graph Theory, Narosa Publishing House, Reprint, 1969.
[2] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker Inc., New York, 1998.
[3] T.N. Janakiraman, S. Muthammai and M. Bhanumathi, “On Splitting Graphs,” Ars Combinatoria, vol. 82, pp. 211-221, 2007.
[4] E. Sampathkumar and H.B. Walikar, “On the splitting graph of a graph,” J. Karnataka Univ. Sci., vol. 25 and 26 (combined) pp. 13-16, 1980-1981.
[5] S. Muthammai, M. Bhanumathi and P. Vidhya, “Complementary tree domination number of a graph,” International Mathematical Forum, vol. 6, no. 26, pp. 1273-1282, 2011.
[6] V. Swaminathan and A. Subramanian, “Domination number of splitting graph,| J. Combin. Inform. System Sci., vol. 26, no. 1-4, pp. 17-22, 2001.
S. Muthammai, P. Vidhya, "Complementary Tree Domination in Splitting Graphs of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 31, no. 2, pp. 53-56, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V31P513