Abstract
Fix d≥3. We show the existence of a constant c>0 such that any graph of diameter at most d has average distance at most d−cd3/2n, where n is the number of vertices. Moreover, we exhibit graphs certifying sharpness of this bound up to the choice of c. This constitutes an asymptotic solution to a longstanding open problem of Plesník. Furthermore we solve the problem exactly for digraphs if the order is large compared with the diameter.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.