On the enhanced hyper-hamiltonian laceability of hypercubes
CEA'09 Proceedings of the 3rd WSEAS international conference on Computer engineering and applications
Constructing the nearly shortest path in crossed cubes
Information Sciences: an International Journal
The panpositionable panconnectedness of augmented cubes
Information Sciences: an International Journal
The 3*-connected property of pyramid networks
Computers & Mathematics with Applications
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
The Journal of Supercomputing
Hamiltonian cycles through prescribed edges in k-ary n-cubes
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Mathematical and Computer Modelling: An International Journal
Theoretical Computer Science
A MapReduce-supported network structure for data centers
Concurrency and Computation: Practice & Experience
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem
Information Processing Letters
An efficient routing methodology to tolerate static and dynamic faults in 2-D mesh networks-on-chip
Microprocessors & Microsystems
Node-disjoint paths in a level block of generalized hierarchical completely connected networks
Theoretical Computer Science
On the mutually independent Hamiltonian cycles in faulty hypercubes
Information Sciences: an International Journal
Optimal networks from error correcting codes
ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
Disjoint cycles in hypercubes with prescribed vertices in each cycle
Discrete Applied Mathematics
An improved distributed data aggregation scheduling in wireless sensor networks
Journal of Combinatorial Optimization
Cycles in cube-connected cycles graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.