This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Comments on "A Study of Odd Graphs as Fault-Tolerant Interconnection Networks"
June 2008 (vol. 57 no. 6)
pp. 864
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) [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).

[1] A. Ghafoor and T.R. Bashkow, “A Study of Odd Graphs as Fault-Tolerant Interconnection Networks,” IEEE Trans. Computers vol. 40, no. 2, pp. 225-232, Feb. 1991.
[2] N. Biggs, “Some Odd Graph Theory,” Ann. NY Academy Csi, vol. 319, pp.71-81, 1979.

Index Terms:
Graph algorithms, Path and circuit problems
Citation:
Jong-Seok Kim, Hyeong-Ok Lee, "Comments on "A Study of Odd Graphs as Fault-Tolerant Interconnection Networks"," IEEE Transactions on Computers, vol. 57, no. 6, pp. 864, June 2008, doi:10.1109/TC.2008.53
Usage of this product signifies your acceptance of the Terms of Use.