Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 14, No 2 (2026): Electronic Journal of Graph Theory and Applications

On the dominating partition dimension of Möbius ladders and burger graphs

Ketut Queena Fredlina (Institut Teknologi Bandung)
Pritta Etriana Putri (Institut Teknologi Bandung)
Edy Tri Baskoro (Institut Teknologi Bandung)



Article Info

Publish Date
02 Nov 2026

Abstract

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






Journal Info

Abbrev

ejgta

Publisher

Subject

Electrical & Electronics Engineering

Description

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by the Indonesian Combinatorial Society ...