Fair Domination in Graphs
Yair Caro, Adriana Hansberg, Michael A. Henning

TL;DR
This paper introduces the concept of fair dominating sets in graphs, explores their properties, and establishes bounds on the fair domination number for various classes of graphs, including connected graphs, maximal outerplanar graphs, and trees.
Contribution
It defines the fair domination number and provides bounds and characterizations for different graph classes, including constructions achieving these bounds.
Findings
For connected graphs of order n ≥ 3 with no isolated vertices, fd(G) ≤ n - 2.
In maximal outerplanar graphs, fd(G) < 17n/19.
For trees of order n ≥ 2, fd(T) ≤ n/2, with equality only for the corona of a tree.
Abstract
A fair dominating set in a graph (or FD-set) is a dominating set such that all vertices not in are dominated by the same number of vertices from ; that is, every two vertices not in have the same number of neighbors in . The fair domination number, , of is the minimum cardinality of a FD-set. We present various results on the fair domination number of a graph. In particular, we show that if is a connected graph of order with no isolated vertex, then , and we construct an infinite family of connected graphs achieving equality in this bound. We show that if is a maximal outerplanar graph, then . If is a tree of order , then we prove that with equality if and only if is the corona of a tree.
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 · Complexity and Algorithms in Graphs
