A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. Chapter 3 addresses Bruijn digraphs, Kautz digraphs, and their generalizations, which are candidates for networks of minimum diameter and maximum connectivity with given degree and number of nodes.