ABSTRACT
A good communications network is hard to disrupt. We want to preserve network service by ensuring that the graph (or digraph) of possible transmissions remains connected, even when some vertices or edges fail. When communication links are expensive, we want to achieve these goals with few edges. Loops are irrelevant for connection, so we may assume that the graphs and digraphs of this chapter have no loops.
