Reviewing some results on fair domination in graphs

Inici | Què és? | Contacte

English | Castellano

Consultar RECERCAT

Per comunitats i
col·leccions Per data Per autors Per títols Per matèries

Consultar col·lecció

Per data Per autors Per títols Per matèries

Estadístiques

Del document Tot RECERCAT

El meu RECERCAT

Entrar Alertes per correu-e

Directori d’altres repositoris

Pàgina inicial del RECERCAT > Universitat Politècnica de Catalunya > Documents de recerca > Visualitza document

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

dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	Hansberg Pastor, Adriana
dc.date	2013-09
dc.identifier.citation	Hansberg, A. Reviewing some results on fair domination in graphs. "Electronic notes in discrete mathematics", Setembre 2013, vol. 43, p. 367-373.
dc.identifier.citation	1571-0653
dc.identifier.citation	10.1016/j.endm.2013.07.054
dc.identifier.uri	http://hdl.handle.net/2117/20340
dc.language.iso	eng
dc.relation	http://www.sciencedirect.com/science/article/pii/S1571065313002060
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta
dc.subject	Fair domination (Mathematics)
dc.subject	Grafs, Teoria de
dc.subject	http://upcommons.upc.edu/e-prints/submit/cercador_materies.jsp?nom=Grafs&kind=1&ID1=dc_subject_lemac_1
dc.title	Reviewing some results on fair domination in graphs
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/article
dc.description.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].
dc.description.abstract	Peer Reviewed

Mostra el registre simple del document

Documents relacionats

Altres documents del mateix autor/a

Degrees in oriented hypergraphs and Ramsey p-chromatic number

Caro, Y.; Hansberg Pastor, Adriana

Locating-dominating sets and identifying codes in Graphs of Girth at least 5

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

New approach to the k-independence number of a graph

Caro, Yair; Hansberg Pastor, Adriana

On k-domination and j-independence in graphs

Hansberg Pastor, Adriana; Pepper, Ryan

Partitions of graphs into small and large sets

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

Accessibilitat | Avís legal | Política de Cookies | Documents d'ús intern

Coordinació

Patrocini