Locating-dominating set in a connected graph G is a dominating set S of G such that for every pair of vertices u and v in V (G)\S, N(u) S 6= N(v) S. Further, if S is a total dominating set, then S is called a locatingtotal dominating set. The locating-domination number L(G) is the minimum cardinality of a locating-dominating set of G and the locating-total domination number L t (G) is the minimum cardinality of a locating-total dominating set of G. In this paper we prove that if G is a necklace or a windmill graph, then L(G) = L t (G). © 2015 Academic Publications, Ltd.