Constructions of hamiltonian graphs with bounded degree and diameter O (log n)

Aleksandar Ili\' c, Dragan Stevanovi\' c

Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for con…