The maximum average connectivity among all orientations of a graph

Rocio M. Casablanca, Peter Dankelmann, Wayne Goddard +2

For distinct vertices $u$ and $v$ in a graph $G$, the {\em connectivity} between $u$ and $v$, denoted ${\kappa }_G(u,v)$, is the maximum number of internally disjoint $u$--$v$ paths in $G$…