Equitable Dominator Coloring of Middle Graph Certain Graph

Seethaladevi, S and Jayaraman, G (2025) Equitable Dominator Coloring of Middle Graph Certain Graph. In: Global Conference on Computational Mathematics and Intelligent Engineering Applications (GCCMIEA 2025), Dec 27 to29 _2025, Thailand.

[thumbnail of GCCMIEA-Conf_Proc_Seetha_Jay-2025.pdf]

Text
GCCMIEA-Conf_Proc_Seetha_Jay-2025.pdf - Published Version
Download (731kB)

Abstract

In this study, we explore the concepts of Dominator Coloring and Equitable. A dominator coloring is defined as a proper coloring in which every vertex dominates at least one vertex
in some color class. An equitable dominator coloring extends this concept by requiring that the color classes differ in cardinality by at most one while preserving the domination
condition. The Dominator Chromatic Number and Equitable Dominator Chromatic Number of these middle graphs are determined and analyzed.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	Mathematics > Graph Theory
Domains:	Mathematics
Depositing User:	IR Admin
Date Deposited:	03 Sep 2026 08:37
Last Modified:	03 Sep 2026 08:37
URI:	https://ir.vistas.ac.in/id/eprint/22456

Actions (login required)

: View Item