Class of communication networks with optimal connectivity

A network has optimal connectivity if the number of alternative paths between any pair of vertices is the greatest possible with the given number of lines and vertices. A new class of optimal configurations is described, which is sufficiently extensive to enable networks to be devised with almost any required connectivity, provided that the number of vertices is factorisable. Some implications for communication networks are discussed.