Efficient Broadcasting Algorithm in Harary-like Networks
Puspal Bhabak, Hovhannes A. Harutyunyan, Peter Kropf · 2017
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 Cordal-Haray 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 show that when nodes of a Cordal-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 this properties show that Cordal-Harary is a very good network architecture for parallel processing.