Terunao Soneoka

Learn More
For designing reliable and efficient communications networks, the problem of constructing a maximally connected d-regular digraph (directed graph) with a small diameter is investigated. A maximally connected d-regular digraph with a diameter at most two larger than the lower bound for any number of nodes n > 2d and any d > 3 is constructed. Since the(More)
A s suitable topology for interconnection networks of multiprocessors, De Bruijn graphs have been proposed and a number of investigations have been conducted on their fault tolerance. A De Bruijn graph is a directed graph with maximum degree d (the maximum number of links that can be connected to one processor), diameter k (maximum number of repeaters(More)
  • 1