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.
No takes yet. Share an insight, caveat, or question.
Imase et al. (1985) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: