Locating total dominating sets in the join, corona and composition of graphs
Benjamin N. Omamalin, Sergio R. Canoy, Helen Moso Rara · Applied Mathematical Sciences · 2014
Let G =( V (G),E(G)) be a connected graph. A subset S of V (G) is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The set NG(v) is the set of all vertices of G adjacent to v .A subset S of V (G) is a locating set of G if NG(u)∩SNG(v)∩S for every two distinct vertices u and v in V (G) S. A locating subset S of V (G) which is also a total dominating set is called a locating total dominating set of G. The minimum cardinality of a locating total dominating set of G is called the locating total domination number of G. In this paper, we determine the locating total domination numbers of the join, corona and composition of graphs.