Abstract

Multiloop networks is a family of network topologies which is an extension of the ring topology. In this thesis we study the structural properties of bipartite double loop networks using the plane tessellation technique. We also study the problem of broadcasting in the bipartite double loop networks and in triple loop networks. For the first kind of graphs we find that the broadcast time is d + 2 where d is the diameter of the graph. For the triple loop graphs, we give a d + 5 upper bound on the broadcast time by providing an algorithm that completes broadcasting in at most d + 5 time units. We also find a d + 2 lower bound for the optimal triple loop graphs, these are the graphs with maximum number of nodes given a diameter d . Finally we give an upper bound for the broadcast time of undirected Circulant (also called multiloop) graphs of degree 2 k which is d + 2 k - 1