Abstract
We give a tight upper bound on the average distance of a connected graph of given order in terms of its connected domination number. Our results are a strengthening of a result by DeLaViña, Pepper, and Waller [A note on dominating sets and average distance, Discrete Mathematics 309 (2009) 2615–2619] on average distance and connected domination number.
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 callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: 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.
