Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Reviewing some results on fair domination in graphs

Autor
Hansberg, A.
Tipus d'activitat
Article en revista
Revista
Electronic notes in discrete mathematics
Data de publicació
2013-09
Volum
43
Pàgina inicial
367
Pàgina final
373
DOI
https://doi.org/10.1016/j.endm.2013.07.054 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/20340 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S1571065313002060 Obrir en finestra nova
Resum
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...
Citació
Hansberg, A. Reviewing some results on fair domination in graphs. "Electronic notes in discrete mathematics", Setembre 2013, vol. 43, p. 367-373.
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants

  • Hansberg Pastor, Adriana  (autor)