FAULT TOLERANT RING EMBEDDING IN TETRAVALENT CAYLEY NETWORK GRAPHS
Premkumar Vadapalli, Pradip K. Srimani · Journal of Circuits Systems and Computers · 1996
Our purpose in the present paper is to investigate the structural properties of the newly proposed Cayley networks of constant node degree 4. We show that the graph contains rings of maximal length in the presence of multiple faults. Our results provide further evidence to the usefulness and robustness of these network graphs.