Some results on the open locating-total domination number in graphs

In this paper, we generalize the concept of an open locating-dominating set in a graph. We introduce a concept as an open locating-total dominating set in graphs that is equivalent to the open neighborhood locating-dominating set. A vertex set S ⊆ V (G) is an open locating-total dominating if the set S is a total dominating set of G and for any pair of distinct vertices x and y in V (G), N(x) ∩ S  ≠ N(y) ∩ S. The open locating-total domination number, denoted γtOL(G), of G is the minimum cardinality of an open locating-total dominating set. In this paper, we determine the open locating-total dominating set of some families of graphs. Also, the open locating-total domination number is calculated for two families of trees. The present paper is an extended version of our paper, presented at the 52nd Annual Iranian Mathematics Conference, Shahid Bahonar University of Kerman, Iran, 2021.