Now showing items 1-1 of 1

• Average distance and edge-connectivity I ﻿

(Society for Industrial and Applied Mathematics, 2015-01-15)
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) ...