2022/12/28 by Marcin Anholcer, Anholcer, Marcin, Azam Sadat Emadi +3
Computer Science · #05C15 #05C69 #05C78 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.2212.14082
openalex publication_date 2022/12/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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. The majority dominator chromatic number χmd(G) is the minimum number of color classes in a majority dominator coloring of G. In this paper we study properties of the majority dominator coloring of a graph. We obtain tight upper and lower bounds in terms of chromatic number, dominator chromatic number, maximum degree, domination and independence number. We also study majority dominator coloring number of selected families of graphs.