“…Charon et al [3] have proved that determining locatingdominating number of a graph is NP-complete problem which is reduced from 3-SAT. However, some results for certain classes of graphs have been obtained, such as paths [2], cycles [4], stars [5], complete graphs [6], bipartite graphs [7,8], complete multipartite graphs [5], wheels [7], twin-free graphs [9,10], and hypergraphs [11]. In [12], Balbuena et al investigated a locating-dominating set of graphs with girth at least 5.…”