Rights accessRestricted access - publisher's policy
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].
CitationHansberg, A. Reviewing some results on fair domination in graphs. "Electronic notes in discrete mathematics", Setembre 2013, vol. 43, p. 367-373.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org