Locating Total Dominating Sets in the Join, Corona and Composition of Graphs

@article{Omamalin2014LocatingTD,
title={Locating Total Dominating Sets in the Join, Corona and Composition of Graphs},
author={Benjamin N. Omamalin and S. Canoy and Helen M. Rara},
journal={Applied mathematical sciences},
year={2014},
volume={8},
pages={2363-2374}
}

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… Expand