No abstract

No abstract

No abstract

Let G be a connected graph. Dominating set is a set of vertices which each vertex D has at least one neighbor in G. The minimum cardinality of D is called the domination number G(γ(G)). The metric dimension of G is the minimum cardinality of a series of vertices so that each vertex G is uniquely. It is determined by the distance of vector to the selected vertices. A dominating metric dimension set is a set of vertices has a dominating set D which has condition of metric dimension. The minimum cardinality is called the resolving domination number of G, (DomDim (G)). We analyze the resolving domination number of helm graph and it’s operation. We study combine the existence concept of dominating set and metric dimension. We have obtained the minimum cardinality of dominating number.

No abstract