A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
The average distance of a graph (strong digraph) G, denoted by (G) is the average, among the distances between all pairs (ordered pairs) of vertices of G. If G is a 2-edge-connected graph, then˜ min (G) is the minimum average distance taken over all strong orientations of G. A lower bound for˜ min (G) in terms of the order, size, girth and average distance of G is established and shown to be sharp for several complete multipartite graphs. It is shown that there is no upper bound for˜ min (G) indoi:10.1016/j.dam.2004.01.005 fatcat:tbhv4fceybbd7bxe6y6qexquum