ABSTRACT


      UNIFORMLY CONNECTED GRAPHS AND BOUNDS ON THE MEAN CONNECTIVITY

The connectivity between two vertices u and v in a graph G is defined to
be the maximum cardinality of a collection of internally disjoint paths
between u and v, and the mean connectivity of G is the average of these
values taken over all pairs of vertices.  We will discuss bounds on the
mean connectivity and present some constructions for graphs in which all
pairs of vertices have the same connectivity.  The edge version of this
parameter as well as results for tournaments will also be discussed. 

Lowell Wayne Beineke