Some characterization theorems on dominating chromatic partition-covering number of graphs

dc.creator	Michael Raj, L. Benedict
dc.creator	Ayyaswamy, S. K.
dc.date	2017-03-23
dc.identifier	http://www.revistaproyecciones.cl/article/view/1291
dc.identifier	10.4067/S0716-09172014000100002
dc.description	Let G = (V, E) be a graph of order n = \|V\| and chromatic number (G) A dominating set D of G is called a dominating chromatic partition-cover or dcc-set, if it intersects every color class of every X-coloring of G. The minimum cardinality of a dcc-set is called the dominating chromatic partition-covering number, denoted dcc(G). The dcc-saturation number equals the minimum integer i such that every vertex ν ∈ V is contained in a dcc-set of cardinality k.This number is denoted by dccs(G) In this paper we study a few properties ofthese two invariants dcc(G) and dccs(G)	es-ES
dc.format	application/pdf
dc.language	spa
dc.publisher	Universidad Católica del Norte.	es-ES
dc.relation	http://www.revistaproyecciones.cl/article/view/1291/1003
dc.rights	Derechos de autor 2014 Proyecciones. Journal of Mathematics	es-ES
dc.source	Proyecciones. Journal of Mathematics; Vol 33 No 1 (2014); 13-23	en-US
dc.source	Proyecciones. Revista de Matemática; Vol. 33 Núm. 1 (2014); 13-23	es-ES
dc.source	0717-6279
dc.source	0716-0917
dc.title	Some characterization theorems on dominating chromatic partition-covering number of graphs	es-ES
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	Artículo revisado por pares	es-ES