@article{ajams2014247,
author={{Jeyanthi, P. and Hemalatha, G. and Davvaz, B.},
title={Total Domination Subdivision Number in Strong Product Graph},
journal={American Journal of Applied Mathematics and Statistics},
volume={2},
number={4},
pages={216--219},
year={2014},
url={http://pubs.sciepub.com/ajams/2/4/7},
issn={2333-4576},
abstract={A set <i>D </i>of vertices in a graph G(V,E) is called a total dominating set if every vertex v&#8712;V is adjacent to an element of <i>D.</i> The domination subdivision number of a graph <i>G</i> 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.},
doi={10.12691/ajams-2-4-7}
publisher={Science and Education Publishing}
}