Wide Containers in Gaussian Networks

The w-wide diameter of a graph is a generalisation of its diameter and connectivity, and is useful for measuring the reliability of an interconnection network. The Gaussian networks, which are defined via quotient rings of the Gaussian integers, have been shown to satisfy many good properties of an interconnection network. In this paper, we will establish the wide diameters of the Gaussian networks and show that they are at most three more than the diameter.