| Summary: | Let G be a graph having no loop or multiple edges, k−order vertex partition for G is represented by γ=γ1,γ2,…,γk. The vector rϕγ=dϕ,γ1,dϕ,γ2,dϕ,γ3⋯,dϕ,γk is the representation of vertex ϕ with respect to γ. If the representation of all the vertices with respect to γ is different, then γ is said to be resolving partition for the graph G. The minimum number k is resolving partition for G and is termed as partition dimension for G, represented by pdG. There are numerous applications of partition dimension in different fields such as optimization, computer, mastermind games, and networking and also in modeling of numerical structure. The problem of finding constant value of partition dimension for a graph or network is very hard, so one can find bounds for the partition dimension. In this work, we consider convex polytopes in their generalized forms that are En,Sn, and Gn, and we compute upper bounds for the partition dimension of the desired polytopes.
|
|---|