Graph Theory and Interconnection Networks
Autor Lih-Hsing Hsu, Cheng-Kuan Linen Limba Engleză Paperback – 23 sep 2019
Preț: 512.59 lei
Preț vechi: 640.74 lei
-20%
Puncte Express: 769
Carte tipărită la comandă
Livrare economică 20 iulie-03 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9780367386771
ISBN-10: 0367386771
Pagini: 720
Dimensiuni: 156 x 234 x 30 mm
Greutate: 0.45 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
ISBN-10: 0367386771
Pagini: 720
Dimensiuni: 156 x 234 x 30 mm
Greutate: 0.45 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
Public țintă
Academic and Professional Practice & DevelopmentCuprins
Fundamental Concepts. Applications on Graph Isomorphisms. Distance and Diameter. Trees. Eulerian Graphs and Digraphs. Matchings and Factors. Connectivity. Graph Coloring. Hamiltonian Cycles. Planar Graphs. Optimal k-Fault-Tolerant Hamiltonian Graphs. Optimal 1-Fault-Tolerant Hamiltonian Graphs. Optimal k-Fault-Tolerant Hamiltonian-Laceable Graphs. Spanning Connectivity. Cubic 3*-Connected Graphs and Cubic 3*-Laceable Graphs. Spanning Diameter. Pancyclic and Panconnected Property. Mutually Independent Hamiltonian Cycles. Mutually Independent Hamiltonian Paths. Topological Properties of Butterfly Graphs. Diagnosis of Multiprocessor Systems. References. Index.
Descriere
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 graph terminology, this book presents well-known interconnection networks as examples of graphs, followed by in-depth coverage of Hamiltonian graphs. Different types of problems illustrate the wide range of available methods for solving such problems. The text also explores recent progress on the diagnosability of graphs under various models.