Abstract
A vertex v of a graph $$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$$ is a vertex–edge dominating set (double vertex–edge dominating set, respectively) if every edge of E is ve-dominated by at least one vertex (at least two vertices) of S. The minimum cardinality of a vertex–edge dominating set (double vertex–edge dominating set, respectively) of G is the vertex–edge domination number $$\gamma _{ve}(G)$$ (the double vertex–edge domination number $$\gamma _{dve}(G)$$ , respectively). The influence of edge removal, edge addition and edge subdivision on the double vertex–edge domination number of a graph are investigated in this paper.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
