Equitable Dominator Coloring of Graphs

This paper introduces a new variant of domination-related coloring of graphs, which is a combination of their dominator coloring and equitable coloring called the equitable dominator coloring. An equitable coloring is a proper coloring in which the number of vertices in each color class differs by at most one. In this newly introduced coloring, an additional condition of equitability is added to the existing concept of dominator coloring. The minimum number of colors used in this coloring is called the equitable dominator chromatic number, represented by $χ_{ed}(G)$. The concept of equitable dominator coloring is explored for basic graph classes. The equitable dominator chromatic number is obtained for the same and some observations on the bounds are made in this paper.