A locating-dominating set of an undirected graph is a subset vertices S such that dominating and for every u,v?S, the neighbourhood u v on are distinct (i.e. N(u)?S?N(v)?S). Locating-dominating sets have received considerable attention in last decades. In this paper, we consider oriented version problem. each w?V?S, N?(w)?S?? pair u,v?V?S, N?(u)?S?N?(v)?S. We following two parameters. Given G, ...