Abstract
For a graph G, an ordered set S subset of V (G) is called the resolving set of G, if the vector of distances to the vertices in S is distinct for every v is an element of V (G). The minimum cardinality of S is termed as the metric dimension of G. S is called a fault-tolerant resolving set (FTRS) for G, if S\{v} is still the resolving set for all v is an element of V (G). The minimum cardinality of such a set is the fault-tolerant metric dimension (FTMD) of G. Due to enormous application in science such as mathematics and computer, the notion of the resolving set is being widely studied. In the present article, we focus on determining the FTMD of a generalized wheel graph. Moreover, a formula is developed for FTMD of a wheel and generalized wheels. Recently, some bounds of the FTMD of some of the convex polytopes have been computed, but here we come up with the exact values of the FTMD of two families of convex polytopes denoted as D-k for k >= 4 and Q(k) for k >= 6. We prove that these families of convex polytopes have constant FTMD. This brings us to pose a natural open problem about the existence of a polytope having nonconstant FTMD.