论文信息 - 1-fault tolerant design for token rings

1-fault tolerant design for token rings

In this paper, we present a family of S-regular, planar, and Hamiltonian graphs. Any graph in this family remains Hamiltonian if any node or any edge is deleted. Moreover, the diameter of any graph in this family is O(/spl radic/p) where p is the number of nodes.

Lih-Hsing Hsu | Jeng-Jung Wang | Chun-Nan Hung

[1] Bhabani P. Sinha,et al. Hamiltonian Graphs with Minimum Number of Edges for Fault-Tolerant Topologies , 1992, Inf. Process. Lett..

[2] John P. Hayes,et al. Edge fault tolerance in graphs , 1993, Networks.