CHANGING AND UNCHANGING THE DIAMETER OF A HYPERCUBE

In a network of processors representing a massively parallel computer, the speed of communication is related to the diameter of the underlying graph. We investigate how the diameter of the hypercube Q(n) is affected by the removal of edges (presence of edge faults). In particular, we calculate the least number of edges whose removal increases the diameter and we show that asymptotically most of the edges of Q(n) may be removed without changing the diameter. For this purpose, a new family of spanning subgraphs of Q(n) of minimum diameter are constructed from pairs of broadcast trees. The corresponding invariants for edge addition to hypercubes are also determined.