Abstract
On several occasions in Chapter 2 we realized that a different labeling for the recursively obtained Hanoi graphs H 3 n (see Figure 2.12) would be desirable. We will realize this with the same recursive procedure, yielding graphs isomorphic to H 3 n , with the same vertex set, but with different edge sets.
Preview
Unable to display preview. Download preview PDF.
Copyright information
© Springer International Publishing AG, part of Springer Nature 2018