Let G be a connected graph and let Π = {S1, S2, …, Sk} be a partition of V(G). The partition Π is called a dominating resolving partition of G if distinct vertices have distinct distance representations with respect to Π, and every vertex has a neighbor in a partition class different from its own. The minimum number of classes in such a partition is called the dominating partition dimension of G, denoted by ηp(G). In this paper, we determine the dominating partition dimension of two families of cubic graphs: Möbius ladders and burger graphs with range one. We show that the dominating partition dimension is equal to 4 for both families within the specified ranges.
Copyrights © 2026