Abstract:
This paper clarifies the relation between the diameter k and the edge or node connectivity Ce or c,, of digraphs. The following two inequalities are derived: where n is t...Show MoreMetadata
Abstract:
This paper clarifies the relation between the diameter k and the edge or node connectivity Ce or c,, of digraphs. The following two inequalities are derived: where n is the number of nodes, d is the maximum degree, and d is the minimum degree.
Published in: IEEE Transactions on Computers ( Volume: C-34, Issue: 3, March 1985)