Ketut Queena Fredlina
Institut Teknologi Bandung

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

On the dominating partition dimension of Möbius ladders and burger graphs Ketut Queena Fredlina; Pritta Etriana Putri; Edy Tri Baskoro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 2 (2026): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2026.14.2.13

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.