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

Authors

Keywords:

Power dominator chromatic number, Cartesian product, Indu-Bala Product

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.

Downloads

Published

2024-09-18

How to Cite

I. Chandramani, A. S. Prasanna Venkatesan, & M.G.Fajlul Kareem. (2024). Power Dominator Chromatic Number of Cartesian and Indu-Bala Product of Some Graphs. Journal of Computational Analysis and Applications (JoCAAA), 33(4), 159–163. Retrieved from https://www.eudoxuspress.com/index.php/pub/article/view/579

Issue

Vol. 33 No. 4 (2024): Selected Papers on Computational Techniques Across Multidisciplinary Fields: Innovations and Applications

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.