Basic Structures of Some Interconnection Networks

Beginning in the late 1980ʹs attractive alternatives to the n-cubes were proposed as the topologies for larger interconnection networks. These graphs tend to have many vertices as well as good connectivity and routing properties. We will look at recent developments on some newer topologies such as star graphs, alternating group graphs, split-stars, arrangement graphs and generalized (n,k) star graphs. We will present results on routing algorithms, various connectivity measures, structural theorems, augmentation, and open problems. Some applications suggest directed graphs, so the directed versions of above graphs will also be considered.