Title :
Connectivity of Regular Directed Graphs with Small Diameters
Author :
Imase, Makoto ; Soneoka, Terunao ; Okada, Keiji
Author_Institution :
Musashino Electrical Communication Laboratory, Nippon Telegraph and Telephone Public Corporation
fDate :
3/1/1985 12:00:00 AM
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.
Keywords :
Communication networks; connectivity maximization; diameter minimization; directed graphs; interconnection networks; Communication networks; Communication switching; Computer network reliability; Computer networks; Distributed computing; Fault tolerance; Multiprocessor interconnection networks; Switching systems; Telecommunication network reliability; Telegraphy; Communication networks; connectivity maximization; diameter minimization; directed graphs; interconnection networks;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1985.1676569
