Average distance and connected domination
AKCE International Journal of Graphs and Combinatorics(2023)
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 DeLaVina, Pepper, and Waller [A note on dominating sets and average distance, Discrete Mathematics 309 (2009) 2615-2619] on average distance and connected domination number.
MoreTranslated text
Key words
Average distance,connected domination
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined