Let G = (V,E) be a connected graph. Let W = {w_1,w_2,...,w_k} be a subset of V with an order imposed on it. Then W is called a resolving set for G if for every two distinct vertices x, y ∈ V(G), there is a vertex w_i ∈ W such that d(x, w_i) ≠ d(y, w_i). The minimum cardinality of a resolving set of G is called the metric dimension of G and is denoted by dim(G). A subset W is called an independent resolving set for G if W is both independent and resolving. The minimum cardinality of an independent resolving set in G is called the independent resolving number of G and is denoted by ir(G). In this paper we determine the independent resolving number ir(G) for three classes of convex polytopes.
展开▼
