Total domination and vertex-edge domination in trees.

A vertex v of a graph G = (V,E) is said to ve-dominate every edge incident to v, as well as every edge adjacent to these incident edges. A set S ⊆ V is a vertex-edge dominating set if every edge of E is ve-dominated by at least one vertex of S. The minimum cardinality of a vertex-edge dominating set...

Descripción completa

Detalles Bibliográficos
Autores principales: Y. B., Venkatakrishnan, Hari, Naresh Kumar, Chidambaram, Natarajan
Formato: Artículo (Article)
Idioma:Inglés (English)
Publicado: Universidad Católica del Norte. 2019
Materias:
Acceso en línea:https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3573