Question 2.39

9.

  1. If the edge X6X7 is removed (erased) from each of the graphs in Exercise 1, do the new graphs that result still have Hamiltonian circuits?
  2. If you think of the graphs in Exercise 1 as communications networks, what interpretation might be given to the “removal” of an edge as described in part (a)?

9.

(a) No for (a); yes for (b); no for (c)

(b) No longer possible to send messages between these two sites