Complexity and Approximability of Edge-Vertex Domination in UDG

Vishwanath R. Singireddy, Manjanna Basappa

Given an undirected graph $G=(V,E)$, a vertex $v\in V$ is edge-vertex (ev) dominated by an edge $e\in E$ if $v$ is either incident to $e$ or incident to an adjacent edge of $e$. A…