Double vertex-edge domination in graphs: complexity and algorithms
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Applied Mathematics and Computing"
DOI: 10.1007/s12190-020-01433-5
Abstract: In a graph $$G=(V,E)$$ , a vertex $$v\in V$$ is said to ve-dominate the edges incident on v as well as the edges adjacent to these incident edges on v. A set $$D\subseteq V$$ is… read more here.
Keywords: graphs; double vertex; edge; min dveds ... See more keywords