The dominant metric dimension of graphs.

The be a connected graph with vertex set and edge set . A subset is called a dominating set of if for every vertex in , there exists at least one vertex in such that is adjacent to . An ordered set is called a resolving set of , if every pair of vertices and in have distinct representation with respect to .