Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4652167 | Electronic Notes in Discrete Mathematics | 2013 | 7 Pages |
Abstract
A fair dominating set in a graph G is a dominating set S such that all vertices not in S are dominated by the same number of vertices from S; that is, every two vertices outside S have the same number of neighbors in S. The fair domination number fd(G) of G is the minimum cardinality of a fair dominating set. In this work, we review the results stated in [Caro, Y., Hansberg, A., and Henning, M., Fair domination in graphs, Discrete Math. 312 (2012), no. 19, 2905–2914], where the concept of fair domination was introduced. Also, some bounds on the fair domination number are derived from results obtained in [Caro, Y., Hansberg, A., and Pepper, R., Regular independent sets in graphs, preprint].
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics