Issue No. 06 - June (2008 vol. 57)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.53
Jong-Seok Kim , Oklahoma State University, Stillwater
Hyeong-Ok Lee , Sunchon National University, Sunchon
A. Ghafoor and T. R. Bahskow proposed the fault diameter of Odd graphs is d+1 (d=even) and d+3 (d=odd) . 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).
Graph algorithms, Path and circuit problems
J. Kim and H. Lee, "Comments on "A Study of Odd Graphs as Fault-Tolerant Interconnection Networks"," in IEEE Transactions on Computers, vol. 57, no. , pp. 864, 2008.