On Group Graphs and Their Fault Tolerance
On Group Graphs and Their Fault Tolerance
复制标题
论群图及其容错性
DOI：
10.1109/tc.1987.1676983
复制
发表时间：
1987
影响因子：
3.7
通讯作者：
B. Krishnamurthy
中科院分区：
文献类型：
--
作者：
S. Akers;B. Krishnamurthy
本文将群图作为互连网络的一个来源进行研究。结果表明，虽然这些图具有许多在所有互连网络中都是可取的性质，但它们的多样性允许产生互连网络，这些互连网络可以根据各种特定参数进行优化。描述了生成、组合和分析这些图的阶数、直径、容错性等技术，并导出了一个定理，证明了一大类重要的群图是最优容错性的。文中还包括了一些例子。
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.