ALGORITHM FOR FINDING CONNECTED RESOLVING NUMBER OF A GRAPH

For an ordered subset of vertices and in a connected graph , the -vector is the metric representation of vertex with respect to . is a resolving set for if various vertices of have different representations with respect to . A minimum resolving set is the lowest cardinality resolving set and is the cardinality of the dimension of . A resolving set of is connected if the subgraph produced by is a nontrivial connected subgraph of . The cardinality of the minimal resolving set is the metric dimension of , while the cardinality of the lowest connected resolving set is the connected metric dimension of . A connected metric dimension of , denoted by , is the lowest cardinality of a connected resolving set. The connected resolving number of a graph can be found using the algorithm presented in this work.