A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distributed Networks
2016
International Journal of Advanced Information Technology
The aim of this paper is develop a software module to test the connectivity of various odd-sized HRs and attempted to answer an open question whether the node connectivity of an odd-sized HR is equal to its degree. We attempted to answer this question by explicitly testing the node connectivity's of various oddsized HRs. In this paper, we also study the properties, constructions, and connectivity of hyper-rings. We usually use a graph to represent the architecture of an interconnection network,
doi:10.5121/ijitcs.2016.6301
fatcat:w5uxhokmvnacph5e3unk5wwouy