Abstract
Let G be a simple graph with vertex set V (G) and edge set E(G). A vertex v ∈ V (G) vertex-edge dominates every edge uv incident to v, as well as every edge adjacent to these incident edges. A set $D\subseteq V(G)$ is a vertex-edge dominating set if every edge of E(G) is vertex-edge dominated by a vertex of D. The vertex-edge dominating set of a minimum cardinality is called minimum vertex-edge dominating set. In this paper, we characterize the set of vertices that are in all or in no minimum vertex-edge dominating sets in trees.
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.
