Average distance and connected domination
AbstractWe 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) 26...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2023-01-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2023.2183913 |