chapter 1 Fundamental Concepts -- chapter 2 Applications on Graph Isomorphisms -- chapter 3 Distance and Diameter -- chapter 4 Trees -- chapter 5 Eulerian Graphs and Digraphs -- chapter 6 Matchings and Factors -- chapter 7 Connectivity -- chapter 8 Graph Coloring -- chapter 9 Hamiltonian Cycles -- chapter 10 Planar Graphs -- chapter 11 Optimal k-Fault-Tolerant Hamiltonian Graphs -- chapter 12 Optimal 1-Fault-Tolerant Hamiltonian Graphs -- chapter 13 Optimal k-Fault-Tolerant Hamiltonian-Laceable Graphs -- chapter 14 Spanning Connectivity -- chapter 15 Cubic 3∗-Connected Graphs and Cubic 3∗-Laceable Graphs -- chapter 16 Spanning Diameter -- chapter 17 Pancyclic and Panconnected Property -- chapter 18 Mutually Independent Hamiltonian Cycles -- chapter 19 Mutually Independent Hamiltonian Paths -- chapter 20 Topological Properties of Butterfly Graphs -- chapter 21 Diagnosis of Multiprocessor Systems.