ALGORITHM FOR FINDING DOMINATION RESOLVING NUMBER OF A GRAPH

A minimum resolving set is a resolving set with the lowest cardinality and its cardinality is a dimension of connected graph G=(V,E), represented by dim(G). A dominating set D is a set of vertices such that each ν of G is either in D or has at least one neighbor in D. The dominance number of G is the lowest cardinality of such a set. The lowest cardinality of the dominant resolving set is called a dominant metric dimension of G, represented by Dd(G). This paper presents an algorithm for finding the domination resolving number of a graph.