Abstract
A set D of vertices in a graph G is a disjunctive dominating set in G if every vertex not in D is adjacent to a vertex of D or has at least two vertices in D at distance 2 from it in G. The disjunctive domination number, γd2(G), of G is the minimum cardinality of a disjunctive dominating set in G. We show that if T is a tree of order n with l leaves and s support vertices, then n-l+3/4≤γd2(T)≤n+l+s/4. Moreover, we characterize the families of trees which attain these bounds.
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.
