Majority dominator colorings of graphs
Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh

TL;DR
This paper introduces the concept of majority dominator coloring in graphs, analyzing its properties, bounds, and behavior across different graph families, expanding understanding of graph coloring constraints.
Contribution
It defines the majority dominator chromatic number and establishes bounds relating it to other graph invariants, along with studying this coloring in specific graph families.
Findings
Established tight bounds for the majority dominator chromatic number.
Analyzed properties of majority dominator coloring in various graph classes.
Connected majority dominator coloring to other graph parameters like chromatic and domination numbers.
Abstract
Let be a simple graph of order . A majority dominator coloring of a graph is proper coloring in which each vertex of the graph dominates at least half of one color class. The majority dominator chromatic number is the minimum number of color classes in a majority dominator coloring of . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems
