文章基本信息

标题：Total Domination Subdivision Number in Strong Product Graph
本地全文：下载
作者：P. Jeyanthi ; G. Hemalatha ; B. Davvaz 等
期刊名称：American Journal of Applied Mathematics and Statistics
印刷版ISSN：2328-7306
电子版ISSN：2328-7292
出版年度：2014
卷号：2
期号：4
页码：216-219
DOI：10.12691/ajams-2-4-7
语种：English
出版社：Science and Education Publishing
摘要：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.
关键词：total dominating set; strong product graph; total domination number