Affiliation:
1. College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China
Abstract
In this paper, we consider the concept of the average edge-connectivity [Formula: see text] of a graph [Formula: see text], defined to be the average, over all pairs of vertices, of the maximum number of edge-disjoint paths connecting these vertices. Kim and O previously proved that [Formula: see text] for any connected cubic graph on [Formula: see text] vertices. We refine their result by showing that [Formula: see text] We also characterize the graphs where equality holds.
Publisher
World Scientific Pub Co Pte Ltd
Subject
Computer Networks and Communications