Reviewing some results on fair domination in graphs

Consultar RECERCAT

Per accedir als documents amb el text complet, si us plau, seguiu el següent enllaç: http://hdl.handle.net/2117/20340

Títol:	Reviewing some results on fair domination in graphs
Autor/a:	Hansberg Pastor, Adriana
Altres autors:	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
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].
Abstract:	Peer Reviewed
Matèries:	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta -Fair domination (Mathematics) -Grafs, Teoria de -http://upcommons.upc.edu/e-prints/submit/cercador_materies.jsp?nom=Grafs&kind=1&ID1=dc_subject_lemac_1
Drets:
Tipus de document:	Article - Versió publicada Article
Compartir:

Caro, Y.; Hansberg Pastor, Adriana

Balbuena Martínez, Maria Camino Teófila; Foucaud, Florent; Hansberg Pastor, Adriana

Caro, Yair; Hansberg Pastor, Adriana

Hansberg Pastor, Adriana; Pepper, Ryan

Bojilov, Asen; Caro, Yair; Hansberg Pastor, Adriana; Nedyalko, Nevno

Coordinació

Patrocini