CONNECTIVITY, PERSISTENCE AND FAULT-DIAGNOSIS OF INTERCONNECTION NETWORKS BASED ON OK AND 2OK GRAPHS

Various fault-tolerance performance parameters including enumeration of openly disjoint paths, persistence, and resilience of odd graphs O(k) and their doubly bipartite derivatives, 2O(k), are analyzed in this paper. Using a remarkable partitioning property of these graphs, we propose an efficient semi-distributed fault-diagnosis scheme for these networks. It is shown through the performance parameters that both O(k) and 2O(k) graphs have a high degree of fault tolerance and allow efficient fault diagnosis which make these networks comparable or even superior to some other well-known dense networks.