Conditional Diagnosability Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Super connectivity of line graphs
Information Processing Letters
Multilayer grid embeddings of iterated line digraphs
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
On reliability of the folded hypercubes
Information Sciences: an International Journal
Fault diameter of product graphs
Information Processing Letters
Queue layouts of iterated line directed graphs
Discrete Applied Mathematics
Fault-tolerant pancyclicity of augmented cubes
Information Processing Letters
Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
Computers & Mathematics with Applications
The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
Computers & Mathematics with Applications
On the restricted forwarding index problem in communication networks
Computers & Mathematics with Applications
Fault-tolerant analysis of a class of networks
Information Processing Letters
Proof that pyramid networks are 1-Hamiltonian-connected with high probability
Information Sciences: an International Journal
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
An efficient representation of Benes networks and its applications
Journal of Discrete Algorithms
Diameter variability of cycles and tori
Information Sciences: an International Journal
The strong distance problem on the Cartesian product of graphs
Information Processing Letters
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
Information Processing Letters
Super-connected and super-arc-connected Cartesian product of digraphs
Information Processing Letters
A New Fault-Tolerant Routing Algorithm for m-ary n-cube Multi-computers and Its Performance Analysis
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Note: The Independence Number for De Bruijn networks and Kautz networks
Discrete Applied Mathematics
Fault-tolerant embedding of paths in crossed cubes
Theoretical Computer Science
Vertex-bipancyclicity of the generalized honeycomb tori
Computers & Mathematics with Applications
Forwarding index of cube-connected cycles
Discrete Applied Mathematics
Edge-fault-tolerant bipanconnectivity of hypercubes
Information Sciences: an International Journal
On the bipanpositionable bipanconnectedness of hypercubes
Theoretical Computer Science
Super-connected arc-transitive digraphs
Discrete Applied Mathematics
Exact wirelength of hypercubes on a grid
Discrete Applied Mathematics
On the enhanced hyper-hamiltonian laceability of hypercubes
CEA'09 Proceedings of the 3rd WSEAS international conference on Computer engineering and applications
On path bipancyclicity of hypercubes
Information Processing Letters
Super restricted edge connected Cartesian product graphs
Information Processing Letters
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
Discrete Applied Mathematics
Power optimization for application-specific networks-on-chips: A topology-based approach
Microprocessors & Microsystems
A further result on fault-free cycles in faulty folded hypercubes
Information Processing Letters
Cycles embedding in exchanged hypercubes
Information Processing Letters
Hamiltonian paths and cycles passing through a prescribed path in hypercubes
Information Processing Letters
A new performance measure for characterizing fault rings in interconnection networks
Information Sciences: an International Journal
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Information Processing Letters
Maximum induced subgraph of a recursive circulant
Information Processing Letters
Edge-pancyclicity of Möbius cubes
Information Processing Letters
Edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Processing Letters
Super connectivity of line graphs
Information Processing Letters
Fault diameter of Cartesian product graphs
Information Processing Letters
Double-super-connected digraphs
Discrete Applied Mathematics
Path embedding on folded hypercubes
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A clustering model for multicast on hypercube network
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
On disconnection node failure and stochastic static resilience of P2P communication networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
The panpositionable panconnectedness of augmented cubes
Information Sciences: an International Journal
Construction of vertex-disjoint paths in alternating group networks
The Journal of Supercomputing
Super-connected but not super edge-connected graphs
Information Processing Letters
Fault-tolerant edge-pancyclicity of locally twisted cubes
Information Sciences: an International Journal
A note on cycle embedding in hypercubes with faulty vertices
Information Processing Letters
ω-wide diameters of enhanced pyramid networks
Theoretical Computer Science
Panconnectivity of Cartesian product graphs
The Journal of Supercomputing
Non-existence of bipartite graphs of diameter at least 4 and defect 2
Journal of Algebraic Combinatorics: An International Journal
Wirelength of 1-fault hamiltonian graphs into wheels and fans
Information Processing Letters
Pairwise key establishment scheme for hypercube-based wireless sensor networks
Proceedings of the 15th WSEAS international conference on Computers
Conditional fault tolerance of arrangement graphs
Information Processing Letters
Edge-bipancyclicity of star graphs with faulty elements
Theoretical Computer Science
The Journal of Supercomputing
Fault-Free pairwise independent hamiltonian paths on faulty hypercubes
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Constructing node-disjoint paths in enhanced pyramid networks
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Clustering multicast on hypercube network
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
The k-tuple twin domination in generalized de Bruijn and Kautz networks
Computers & Mathematics with Applications
Super restricted edge connectivity of regular edge-transitive graphs
Discrete Applied Mathematics
Embedding of hypercubes into necklace, windmill and snake graphs
Information Processing Letters
Theory and network applications of balanced kautz tree structures
ACM Transactions on Internet Technology (TOIT)
Extraconnectivity of k-ary n-cube networks
Theoretical Computer Science
Theoretical Computer Science
Wirelength of hypercubes into certain trees
Discrete Applied Mathematics
ACSAC'07 Proceedings of the 12th Asia-Pacific conference on Advances in Computer Systems Architecture
Node-disjoint paths in a level block of generalized hierarchical completely connected networks
Theoretical Computer Science
Note: Super restricted edge-connectivity of graphs with diameter 2
Discrete Applied Mathematics
On the metric dimension of line graphs
Discrete Applied Mathematics
{2,3}-Extraconnectivities of hypercube-like networks
Journal of Computer and System Sciences
Paired many-to-many disjoint path covers of the hypercubes
Information Sciences: an International Journal
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Generalized measures of fault tolerance in exchanged hypercubes
Information Processing Letters
Fault diagnosability of arrangement graphs
Information Sciences: an International Journal
Embeddings of circulant networks
Journal of Combinatorial Optimization
Multilayer grid embeddings of iterated line digraphs
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Edge-fault tolerance of hypercube-like networks
Information Processing Letters
Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model
Information Sciences: an International Journal
Vulnerability of super edge-connected networks
Theoretical Computer Science
On the topological properties of HyperX
The Journal of Supercomputing
Dominating problems in swapped networks
Information Sciences: an International Journal
On the partition dimension of a class of circulant graphs
Information Processing Letters
| Hi-index | 0.02 |
This book provides the most basic problems, concepts, and well-established results from the topological structure and analysis of interconnection networks in the graph-theoretic language. It covers the basic principles and methods of network design, several well-known networks such as hypercubes, de Bruijn digraphs, Kautz digraphs, double loop, and other networks, and the newest parameters to measure performance of fault-tolerant networks such as Menger number, Rabin number, fault-tolerant diameter, wide-diameter, restricted connectivity, and (l,w)-dominating number. Audience: The book is suitable for those readers who are working on or intend to start research in design analysis of the topological structure of interconnection networks, particularly undergraduates and postgraduates specializing in computer science and applied mathematics.