In this paper, we analyze the properties of Harary graphs and some derivatives with respect to the achievable performance of communication within network structures based on these graphs. In particular we defined Chord-Harary graphs on n nodes which can be constructed for any even n for any odd degree between 3 and 2 [log n] - 1. We also present a simple algorithm for fast message broadcasting in this network. Our analysis shows that when nodes of a Chord-Harary Graph have logarithmic degree then the broadcasting time will be as small as [log n] which is the minimum possible value for a network on n nodes. All these properties show that Chord-Harary is a very good network architecture for parallel processing.
展开▼
机译：在本文中，我们基于这些图形分析了接近图表和一些衍生物的特性和一些导数的网络结构中可实现的通信性能。特别地，我们在N个节点上定义了Chord-Harary图表，该节点可以在3到2之间的任何奇数的任何奇数的NEV NEN NOME构造[log n] - 1.我们还呈现了一种在该网络中快速消息广播的简单算法。我们的分析表明，当和弦关系图的节点具有对数度的时，广播时间将小于[log n]，这是n个节点上网络的最小可能值。所有这些属性表明，Chord-Harary是一个非常好的并行处理的网络架构。
展开▼
