Graph Theory and Interconnection NetworksCRC Press, 26 sep. 2008 - 720 sidor 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 |
Innehåll
| 1 | |
| 21 | |
Chapter 3 Distance and Diameter | 43 |
Chapter 4 Trees | 61 |
Chapter 5 Eulerian Graphs and Digraphs | 79 |
Chapter 6 Matchings and Factors | 93 |
Chapter 7 Connectivity | 105 |
Chapter 8 Graph Coloring | 125 |
Chapter 14 Spanning Connectivity | 339 |
Chapter 15 Cubic 3 Connected Graphs and Cubic 3 Laceable Graphs | 417 |
Chapter 16 Spanning Diameter | 449 |
Chapter 17 Pancyclic and Panconnected Property | 479 |
Chapter 18 Mutually Independent Hamiltonian Cycles | 509 |
Chapter 19 Mutually Independent Hamiltonian Paths | 545 |
Chapter 20 Topological Properties of Butterfly Graphs | 585 |
Chapter 21 Diagnosis of Multiprocessor Systems | 625 |
Chapter 9 Hamiltonian Cycles | 141 |
Chapter 10 Planar Graphs | 161 |
Chapter 11 Optimal kFaultTolerant Hamiltonian Graphs | 171 |
Chapter 12 Optimal 1FaultTolerant Hamiltonian Graphs | 227 |
Chapter 13 Optimal kFaultTolerant HamiltonianLaceable Graphs | 285 |
References | 687 |
| 703 | |
Back cover | 707 |
Andra upplagor - Visa alla
Graph Theory and Interconnection Networks Lih-Hsing Hsu,Cheng-Kuan Lin Ingen förhandsgranskning - 2008 |
Graph Theory and Interconnection Networks Lih-Hsing Hsu,Cheng-Kuan Lin Ingen förhandsgranskning - 2019 |
Vanliga ord och fraser
1-edge fault-tolerant Hamiltonian 3-regular 3*-connected 3*-container adjacent BF(n bipartite graph black vertex Cayley graph choose a vertex complete graph component condition contains COROLLARY cube cubic defined desired path diagnosability digraph disjoint paths P1 distinct vertices edge-transitive Eulerian circuit exist two disjoint exists a Hamiltonian exists a vertex F joining faulty edges following theorem forms a Hamiltonian forms the desired G1 and G2 graph G Hamiltonian cycle Hamiltonian graphs Hamiltonian path Hamiltonian-connected Hence hypercube illustration independent Hamiltonian cycles independent Hamiltonian paths integer isomorphic least Lemma Let G loss Moreover mutually independent Hamiltonian n-dimensional neighbor number of vertices Obviously P1 and P2 partite set path H path joining path of G Petersen graph planar graph positive integer Proof required paths set P1 shown in Figure star graph subgraph subset Suppose that G t-diagnosable tonian vertex cover vertex set vertex-transitive white vertex