Abstract
We show that the average order of a dominating set of a forest graph G on n vertices with no isolated vertices is at most 2n/3. Moreover, the equality is achieved if and only if every non-leaf vertex of G is a support vertex with one or two leaf neighbors. Our result answers an open question of Beaton and Brown in [The average order of dominating sets of a graph, Discrete Math. 344(12) (2021)].
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.
