This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
July 1987 (vol. 36 no. 7)
pp. 885-888
S.B. Akers, Department of Electrical and Computer Engineering, University of Massachusetts
This paper investigates group graphs as a source of interconnection networks. It is shown that while these graphs possess many properties desirable in all interconnection networks, their diversity allows the generation of interconnection networks which may be optimized with regard to a variety of specific parameters. Techniques are described for generating, combining, and analyzing these graphs with respect to their order, diameter, fault tolerance, etc. A theorem is derived which shows that a large important class of group graphs are optimally fault tolerant. A number of examples are included.
Index Terms:
processor arrays, Distributed architectures, fault-tolerant networks, group graphs, interconnection networks, node-symmetric graphs
Citation:
S.B. Akers, B. Krishnamurthy, "On Group Graphs and Their Fault Tolerance," IEEE Transactions on Computers, vol. 36, no. 7, pp. 885-888, July 1987, doi:10.1109/TC.1987.1676983
Usage of this product signifies your acceptance of the Terms of Use.