Total Domination Subdivision Number in Strong Product Graph
Pon Jeyanthi, G. Hemalatha, Bijan Davvaz · American Journal of Applied Mathematics and Statistics · 2014
A set D of vertices in a graph G(V,E) is called a total dominating set if every vertex v∈V is adjacent to an element of D. The domination subdivision number of a graph G is the minimum number of edges that must be subdivided in order to increase the domination number of a graph. In this paper, we determine the total domination number for strong product graph and establish bounds on the total domination subdivision number for strong product graph.