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
Influence of the Edge Removal, Edge Addition and Edge Subdivision on the Double Vertex–Edge Domination Number of a Graph
Sign Up to like & getrecommendations! Published in 2018 at "National Academy Science Letters"
DOI: 10.1007/s40009-018-0689-z
Abstract: A vertex v of a graph $$G=(V,E)$$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 \subseteq V$$S⊆V is a vertex–edge dominating… read more here.
Keywords: edge domination; domination number; double vertex; edge ... See more keywords
Total vertex-edge domination
Sign Up to like & getrecommendations! Published in 2018 at "International Journal of Computer Mathematics"
DOI: 10.1080/00207160.2017.1343469
Abstract: ABSTRACT A vertex v of a graph is said to ve-dominate every edge incident to v, as well as every edge adjacent to these incident edges. A set is a vertex-edge dominating set (or simply,… read more here.
Keywords: edge domination; edge; dominating set; vertex ... See more keywords