Vertex cover and Edge vertex domination in trees
Author
Senthilkumar, B.
Naresh Kumar, H.
Venkatakrishnan, Y. B.
Full text
https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/353210.22199/issn.0717-6279-3532
Abstract
Let G = (V,E) be a simple graph. An edge e ∈ E(G) edge-vertex dominates a vertex v ∈ V (G) if e is incident with v or e is incident with a vertex adjacent to v. A subset D ⊆ E(G) is an edge-vertex dominating set of a graph G if every vertex of G is edge-vertex dominated by an edge of D. A vertex cover of G is a set C ⊆ V such that for each edge uv ∈ E at least one of u and v is in C. We characterize trees with edge-vertex domination number equals vertex covering number.