In several case of metric dimension for regular graph its an easy task to find resolving set. Since all regular graph follow a specific and justified pattern where as the irregular graph do not follow a pattern. As the number of nodes increases the number of subset following the metric dimension and double metric dimension is difficult to find it. Someone may help to find what methodology should be adopted to solve this difficulty where as there are several minimum resolving sets in number and in case regular graphs but in papers only one specific directional resolving sets are give on some pattern and the results are generalized. This make it the NP-hard problem but advance techniques may be imposed to solve this problem. Here the steps involved in finding metric dimension here are:

i. First properly label a graph.

ii. Find the distance of every nodes.

iii. Find all resolving sets.

iv. Find all non-resolving sets.

v. Find all minimum resolving sets.

vi. Find a logical pattern by using numbers and combinatorics to form general results.

The observation shows the total number of minimum resolving set repeat in half a way. So the algorithm modification must revised to find such NP-hard problem in an efficient way. Same is the case with minimal doubly resolving set (MDRS).