Let G be a simple connected graph. A non-empty subset S of is a strictly locating-dominating set in G if it is a dominating set in G and for every two distinct vertices and  for all  A strictly locating-dominating set  is a restrained strictly locating-dominating set in G if  or  has no isolated vertex. The restrained strictly locating-domination number of G, denoted by  is the smallest cardinality of a restrained strictly locating-dominating set in G.

locating-domination, strictly locating-domination, restrained strictly locating-domination.