Abstract
A vertex–edge dominating set of a graph G is a set D of vertices of G such that every edge of G is incident with a vertex of D or a vertex adjacent to a vertex of D. The vertex–edge domination number of a graph G, denoted by γve(T), is the minimum cardinality of a vertex–edge dominating set of G. We prove that for every tree T of order n⩾3 with l leaves and s support vertices, we have (n−l−s+3)/4⩽γve(T)⩽n/3, and we characterize the trees attaining each of the bounds.
Sign-in/Register to access full text options 
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.
