Abstract
Let Γ = ( V , E ) be a connected graph of order n. Two vertices p and q in V are said to resolve by a vertex x ∈ V if d ( p , x ) ≠ d ( q , x ) . An ordered subset F = { k 1 , k 2 , k 3 , … , k l } of vertices in Γ is said to be resolving set if for every pair p, q of distinct vertices in V, we have ζ ( p | F ) ≠ ζ ( q | F ) , where ζ ( a | F ) = ( d ( a , k 1 ) , d ( a , k 2 ) , d ( a , k 3 ) , … , d ( a , k l ) ) is the l-code/metric coordinate representation of the vertex a with respect to the set F. The resolving set for Γ with minimum cardinality is known as metric basis for the graph Γ and the cardinality of metric basis is called as metric dimension of Γ. In this work, we demonstrate that for two families of convex polytopes which are closely linked, the metric dimension is constant.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call