1-fault tolerant design for token rings
Jeng-Jung Wang, Chun‐Nan Hung, Lih‐Hsing Hsu · 2002
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.