| dc.creator | Krishnakumari, B. | es |
| dc.creator | Venkatakrishnan, Y. B. | es |
| dc.date | 2025-04-17 | |
| dc.date.accessioned | 2025-10-06T15:04:54Z | |
| dc.date.available | 2025-10-06T15:04:54Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1255 | |
| dc.identifier | 10.4067/S0716-09172015000200002 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/255425 | |
| dc.description | A 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 |
| dc.format | application/pdf | |
| dc.language | spa | |
| dc.publisher | Universidad Católica del Norte. | en |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1255/968 | |
| dc.rights | Copyright (c) 2015 Proyecciones. Journal of Mathematics | en |
| dc.rights | https://creativecommons.org/licenses/by/4.0 | en |
| dc.source | Proyecciones (Antofagasta); Vol. 34 No. 2 (2015); 127-136 | en |
| dc.source | Proyecciones. Revista de Matemática; Vol. 34 Núm. 2 (2015); 127-136 | es |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2015 | |
| dc.title | A note on complementary tree domination number of a tree | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
