| Description |
1 online resource (xiii, 706 pages) : illustrations |
| Contents |
Front cover; Contents; Preface; Authors; 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 GraphsChapter 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; References; Index; Back cover |
| Summary |
The advancement of large scale integrated circuit technology has enabled the construction of complex interconnection networks. Graph theory provides a fundamental tool for designing and analyzing such networks. This book provides an understanding of these interrelated topics |
| Bibliography |
Includes bibliographical references (pages 687-701) and index |
| Notes |
Print version record |
| Subject |
Graph theory.
|
|
MATHEMATICS -- Graphic Methods.
|
|
Graph theory
|
| Form |
Electronic book
|
| Author |
Lin, Cheng-Kuan
|
| ISBN |
9781420044829 |
|
1420044826 |
|
1420044818 |
|
9781420044812 |
|
128177443X |
|
9781281774439 |
|
