Metric based resolvability of cycle related graphs

If a subset of vertices of a graph, designed in such a way that the remaining vertices have unique identification (usually called representations) with respect to the selected subset, then this subset is named as a metric basis (or resolving set). The minimum count of the elements of this subset is called as metric dimension. This concept opens the gate for different new parameters, like fault-tolerant metric dimension, in which the failure of any member of the designed subset is tolerated and the remaining subset fulfills the requirements of the resolving set. In the pattern of the resolving sets, a concept was introduced where the representations of edges must be unique instead of vertices. This concept was called the edge metric dimension, and this as well as the previously mentioned concepts belong to the idea of resolvability parameters in graph theory. In this paper, we find all the above resolving parametric sets of a convex polytope $ {F}_{♃} $ and compare their cardinalities.