Connectivity of Regular Directed Graphs with Small Diameters
Imase, Soneoka, Okada · IEEE Transactions on Computers · 1985
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.