Perfect edge domination: hard and solvable cases
Sign Up to like & getrecommendations! Published in 2018 at "Annals of Operations Research"
DOI: 10.1007/s10479-017-2664-3
Abstract: Let G be an undirected graph. An edge of Gdominates itself and all edges adjacent to it. A subset $$E'$$E′ of edges of G is an edge dominating set of G, if every edge of… read more here.
Keywords: edge dominating; perfect edge; edge; graph ... See more keywords
Modelling and solving the perfect edge domination problem
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-018-1335-x
Abstract: A formulation is proposed for the perfect edge domination problem and some exact algorithms based on it are designed and tested. So far, perfect edge domination has been investigated mostly in computational complexity terms. Indeed,… read more here.
Keywords: edge domination; edge; perfect edge; domination problem ... 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
On the Relation Between the Domination Number and Edge Domination Number of Trees and Claw-Free Cubic Graphs
Sign Up to like & getrecommendations! Published in 2025 at "Mathematics"
DOI: 10.3390/math13030534
Abstract: For a connected graph G=(V,E), the dominating set in graph G is a subset of vertices F⊂V such that every vertex of V−F is adjacent to at least one vertex of F. The minimum cardinality… read more here.
Keywords: edge domination; dominating set; edge; domination ... See more keywords