Power Dominator Chromatic Number of Cartesian and Indu-Bala Product of Some Graphs

Abstract

A graph G with a power dominator coloring is a proper coloring that ensures that every vertex has power dominates over every other vertex in a specific color class. This paper focuses on determining the power dominator chromatic number for the Cartesian and Indu-Bala product of various graph classes, such as complete graphs, paths and Cycle, paths and star graphs as well as paths and wheel graphs.