Locating-total domination in graphs

详细信息    查看全文

• 作者：Michael A. Henning^a ; ^{mahenning@uj.ac.za} ; Nader Jafari Rad^b ; ^c ; ^{n.jafarirad@shahroodut.ac.ir}
• 关键词：Total domination ; Locating-total domination
• 刊名：Discrete Applied Mathematics
• 出版年：2012
• 出版时间：September, 2012
• 年：2012
• 卷：160
• 期：13-14
• 页码：1986-1993
• 全文大小：235 K

文摘

In this paper, we continue the study of locating-total domination in graphs. A set of vertices in a graph is a total dominating set in if every vertex of is adjacent to a vertex in . We consider total dominating sets which have the additional property that distinct vertices in are totally dominated by distinct subsets of the total dominating set. Such a set is called a locating-total dominating set in , and the locating-total domination number of is the minimum cardinality of a locating-total dominating set in . We obtain new lower and upper bounds on the locating-total domination number of a graph. Interpolation results are established, and the locating-total domination number in special families of graphs, including cubic graphs and grid graphs, is investigated.