A proper vertex coloring of the graph G such that each vertex dominates at least one color class and the cardinalities of the color classes differ by at most $1$ is called an equitable dominator coloring of G. The minimum number of colors used in this coloring is called the equitable dominator chromatic number (EDCN), represented by χed(G). This article explores the concept of equitable dominator coloring for the line graph $L(G)$ of some graph classes.
No takes yet. Share an insight, caveat, or question.
George et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: