This is a test
- 720 pages
- English
- PDF
- Available on iOS & Android
eBook - PDF
Graph Theory and Interconnection Networks
Book details
Table of contents
Citations
About This Book
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. Graph Theory and Interconnection Networks provides a thorough understanding of these interrelated topics. After a brief introduction to gra
Frequently asked questions
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlegoâs features. The only differences are the price and subscription period: With the annual plan youâll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, weâve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Graph Theory and Interconnection Networks by Lih-Hsing Hsu, Cheng-Kuan Lin in PDF and/or ePUB format, as well as other popular books in Computer Science & Information Technology. We have over one million books available in our catalogue for you to explore.
Information
Table of 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 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
- References
- Index
- Back cover