Show simple item record

A note on complementary tree domination number of a tree

dc.creatorKrishnakumari, B.
dc.creatorVenkatakrishnan, Y. B.
dc.date2015-06-01
dc.date.accessioned2019-11-14T11:59:12Z
dc.date.available2019-11-14T11:59:12Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/1255
dc.identifier10.4067/S0716-09172015000200002
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113046
dc.descriptionA complementary tree dominating set of a graph G, is a set D of vertices of G such that D is a dominating set and the induced sub graph (V \ D) is a tree. The complementary tree domination number of a graph G, denoted by γctd(G), is the minimum cardinality of a complementary tree dominating set of G. An edge-vertex dominating set of a graph G is a set D of edges of G such that every vertex of G is incident with an edge of D or incident with an edge adjacent to an edge of D. The edge-vertex domination number of a graph, denoted by γev (G), is the minimum cardinality of an edge-vertex dominating set of G. We characterize trees for which γ(T) = γctd(T) and  γctd(T) = γev(T) + 1.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/1255/968
dc.rightsDerechos de autor 2015 Proyecciones. Journal of Mathematicses-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 34 No 2 (2015); 127-136en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 34 Núm. 2 (2015); 127-136es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectDominating setes-ES
dc.subjectComplementary tree dominating setes-ES
dc.subjectEdge-vertex dominating setes-ES
dc.subjectTree.es-ES
dc.titleA note on complementary tree domination number of a treees-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