Average distance and edge-connectivity I

Dankelmann, Peter (2015) Average distance and edge-connectivity I.

Full text not available from this repository.
Official URL: http://hdl.handle.net/10646/3381


The results in this paper are part of the second author’s PhD thesis.,The average distance $\mu(G)$ of a connected graph G of order n is the average of the distances between all pairs of vertices of G. We prove that if G is a $\lambda$-edge-connected graph of order n, then the bounds $\mu(G) \le 2n/15+9$ if $\lambda=5,6$, $\mu(G) \le n/9+10$ if $\lambda=7$, and $\mu(G) \le n/(\lambda+1)+5$ if $\lambda \ge 8$ hold. Our bounds are shown to be best possible, and our results solve a problem of Plesník,National Research Foundation and the University of KwaZulu-Natal

Item Type: Article
Uncontrolled Keywords: Plesnik,verticesof G
Divisions: Universities > State Universities > University of Zimbabwe
Depositing User: Mr. Edmore Sibanda
Date Deposited: 09 Sep 2017 22:01
Last Modified: 09 Sep 2017 22:01
URI: http://researchdatabase.ac.zw/id/eprint/5585

Actions (login required)

View Item View Item