1. Clearly, a Hamiltonian network of n identical elements has a higher reliability than that of a spanning tree for n nodes. Show that the improvement ratio is [p + n(1- p)]. 2. Why was Eq. (7.3)...

1. Clearly, a Hamiltonian network of n identical elements has a higher reliability than that of a spanning tree for n nodes. Show that the improvement ratio is [p + n(1- p)].

2. Why was Eq. (7.3) written in terms of probability of failure rather than probability of success?