Majority dominator colorings of graphs

Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh

Let $G$ be a simple graph of order $n$. A majority dominator coloring of a graph $G$ is proper coloring in which each vertex of the graph dominates at least half of one color class…