DocumentCode
1148749
Title
On the Connectivity of Some Telecommunications Networks
Author
Amar, D.
Author_Institution
Laboratoire de Recherche en Informatique, ERA
Issue
5
fYear
1983
fDate
5/1/1983 12:00:00 AM
Firstpage
512
Lastpage
519
Abstract
Memmi and Raillard constructed two families of graphs, regular of degree d and diameter k which are useful for designing telecommunications networks ([(d, k) graph problem]). They conjectured that the connectivity of these graphs were equal to their degree. We prove here these conjectures, that implies that the networks have the best possible reliability.
Keywords
(d, k) graph problem; Connectivity; interconnection networks; network computers; reliability; Circuit faults; Computer network reliability; Electrical fault detection; Fault detection; Multiprocessor interconnection networks; Output feedback; Switching circuits; Telecommunication computing; Telecommunication network reliability; Tree graphs; (d, k) graph problem; Connectivity; interconnection networks; network computers; reliability;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1983.1676267
Filename
1676267
Link To Document