On Partition Dimension of Generalized Convex Polytopes
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 b...
Main Authors: | Syed Waqas Shah, Muhammad Yasin Khan, Gohar Ali, Irfan Nurhidayat, Soubhagya Kumar Sahoo, Homan Emadifar |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2023-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2023/4412591 |
Similar Items
-
On bounded partition dimension of different families of convex polytopes with pendant edges
by: Khali, Adnan, et al.
Published: (2021) -
Cardinality bounds on subsets in the partition resolving set for complex convex polytope-like graph
by: Ali N. A. Koam, et al.
Published: (2024-03-01) -
Omnidimensional Convex Polytopes
by: Szymon Łukaszyk, et al.
Published: (2023-03-01) -
New stochastic fractional integral and related inequalities of Jensen–Mercer and Hermite–Hadamard–Mercer type for convex stochastic processes
by: Fahd Jarad, et al.
Published: (2023-04-01) -
On Center, Periphery and Average Eccentricity for the Convex Polytopes
by: Waqas Nazeer, et al.
Published: (2016-12-01)