dc.creator | Krishnakumari, B. | |
dc.creator | Venkatakrishnan, Y. B. | |
dc.date | 2017-03-23 | |
dc.identifier | http://www.revistaproyecciones.cl/article/view/1216 | |
dc.identifier | 10.4067/S0716-09172016000300002 | |
dc.description | Let 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.format | application/pdf | |
dc.language | spa | |
dc.publisher | Universidad Católica del Norte. | es-ES |
dc.relation | http://www.revistaproyecciones.cl/article/view/1216/929 | |
dc.rights | Derechos de autor 2016 Proyecciones. Journal of Mathematics | es-ES |
dc.source | Proyecciones. Journal of Mathematics; Vol 35 No 3 (2016); 245-249 | en-US |
dc.source | Proyecciones. Revista de Matemática; Vol. 35 Núm. 3 (2016); 245-249 | es-ES |
dc.source | 0717-6279 | |
dc.source | 0716-0917 | |
dc.title | Unicyclic graphs with equal domination and complementary tree domination numbers | 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 |