Abstract
Let G = (V, E) be a connected graph. A locating-total dominating set in a graph G is a total dominating set S of a G, for every pair of vertices i, j ∈ V(G)∖S, such that N(i)∩S ≠ N(j)∩S. The minimum cardinality of a locating-total dominating set is called locating-total domination number and represented as γtL. In this paper, locating-total domination number is determined for some cycle-related graphs. Furthermore, some well-known graphs of convex polytopes from the literature are also considered for the locating-total domination number.