Show simple item record

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

dc.creatorMichael Raj, L. Benedict
dc.creatorAyyaswamy, S. K.
dc.date2017-03-23
dc.date.accessioned2019-11-14T11:59:14Z
dc.date.available2019-11-14T11:59:14Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/1291
dc.identifier10.4067/S0716-09172014000100002
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113082
dc.descriptionLet 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.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/1291/1003
dc.rightsDerechos de autor 2014 Proyecciones. Journal of Mathematicses-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 33 No 1 (2014); 13-23en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 33 Núm. 1 (2014); 13-23es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectDominating setes-ES
dc.subjectchromatic partitiones-ES
dc.subjectdominating chromatic partition-covering numberes-ES
dc.subjectconjunto dominantees-ES
dc.subjectpartición cromáticaes-ES
dc.subjectnúmero de partición cromática dominante.es-ES
dc.titleSome characterization theorems on dominating chromatic partition-covering number of graphses-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES


This item appears in the following Collection(s)

Show simple item record