Show simple item record

Unicyclic graphs with equal domination and complementary tree domination numbers

dc.creatorKrishnakumari, B.
dc.creatorVenkatakrishnan, Y. B.
dc.date2017-03-23
dc.date.accessioned2019-11-14T11:58:54Z
dc.date.available2019-11-14T11:58:54Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/1216
dc.identifier10.4067/S0716-09172016000300002
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113007
dc.descriptionLet G = (V, E) be a simple graph. A set  is a dominating set if every vertex in V(G) \ D is adjacent to a vertex of D. A dominating set D of a graph G is a complementary tree dominating set if induced sub graph (V \ D) is a tree. The domination (complementary tree domination, respectively) number of G is the minimum cardinality of a dominating (complementary tree dominating, respectively) set of G. We characterize all unicyclic graphs with equal domination and complementary tree domination numbers.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/1216/929
dc.rightsDerechos de autor 2016 Proyecciones. Journal of Mathematicses-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 35 No 3 (2016); 245-249en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 35 Núm. 3 (2016); 245-249es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectDominationes-ES
dc.subjectcomplementary tree dominationes-ES
dc.subjectunicyclic graphses-ES
dc.subjectdominaciónes-ES
dc.subjectdominación complementaria de árboleses-ES
dc.subjectgrafos unicíclicoses-ES
dc.titleUnicyclic graphs with equal domination and complementary tree domination numberses-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