Issue No. 03 - March (1985 vol. 34)
M. Imase , Musashino Electrical Communication Laboratory, Nippon Telegraph and Telephone Public Corporation
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.
interconnection networks, Communication networks, connectivity maximization, diameter minimization, directed graphs
M. Imase, T. Soneoka and K. Okada, "Connectivity of Regular Directed Graphs with Small Diameters," in IEEE Transactions on Computers, vol. 34, no. , pp. 267-273, 1985.