DocumentCode
1151639
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
Issue
3
fYear
1985
fDate
3/1/1985 12:00:00 AM
Firstpage
267
Lastpage
273
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;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1985.1676569
Filename
1676569
Link To Document