Comments on "A Study of Odd Graphs as Fault-Tolerant Interconnection Networks"

Authors:
Jong-Seok Kim;Hyeong-Ok Lee
Affiliations:
Oklahoma State University, Stillwater;Sunchon National University, Sunchon
Venue:
IEEE Transactions on Computers
Year:
2008

Citing 0
Cited 2

Optimal Independent Spanning Trees on Odd Graphs

The Journal of Supercomputing
Fault tolerance logical network properties of irregular graphs

ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I

Quantified Score

Hi-index	14.98

Visualization

Abstract

A. Ghafoor and T. R. Bahskow proposed the fault diameter of Odd graphs is d+1 (d=even) and d+3 (d=odd) [1]. However, their their fault diameter is not correct. In this paper, we show the fault diameter of Odd graph is d+1 (d=even or odd).