Dragan Stevanovi' c

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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 constructing hamiltonian graphs with n vertices and maximum degree ∆ and diameter O(log n), where n is an arbitrary number. The number of edges is asymptotically bounded by (2− 1 ∆−1(More)
  • 1