ABSTRACT
In Chapter 11, we have discussed the fault-tolerant Hamiltonian of some families of interconnection networks. Yet we did not discuss the corresponding results for two important families of interconnection networks; namely, the hypercube family and the star graph family. Note that these two families of graphs are bipartite. Any cycle of a bipartite graph is of even length. Thus, any vertex fault in aHamiltonian bipartite graph is not Hamiltonian. However, we can still discuss the edge fault-tolerant Hamiltonicity for bipartite graphs.
