Fault diameter of interconnection networks
From MaRDI portal
Publication:1101090
DOI10.1016/0898-1221(87)90085-XzbMath0641.94048OpenAlexW2006915927MaRDI QIDQ1101090
Publication date: 1987
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(87)90085-x
Related Items (39)
Restricted fault diameter of hypercube networks ⋮ Topological properties of star graphs ⋮ Fault diameter of Cartesian product graphs ⋮ Edge, vertex and mixed fault diameters ⋮ Fault-diameter of Cartesian graph bundles ⋮ Fault diameter of product graphs ⋮ Combinatorial properties of generalized hypercube graphs ⋮ Some network topological notions of the Mycielskian of a graph ⋮ A diagnosis algorithm by using graph-coloring under the PMC model ⋮ A unified formulation of Kautz network and generalized hypercube ⋮ Large fault-tolerant interconnection networks ⋮ The vulnerability of the diameter of folded \(n\)-cubes ⋮ Robustness of random graphs based on graph spectra ⋮ The fault-diameter and wide-diameter of twisted hypercubes ⋮ Edge-fault diameter of \(C_4\)-free graphs ⋮ Some diameter notions of Fibonacci cubes ⋮ Fault-tolerant diameter for three family interconnection networks ⋮ Lower bounds for the Estrada index using mixing time and Laplacian spectrum ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ The diameter vulnerability of the generalized Petersen graphGP[tk;k] ⋮ The Optimal Design of Low-Latency Virtual Backbones ⋮ The fault-diameter of Cartesian products ⋮ Stirling networks: A versatile combinatorial topology for multiprocessor systems ⋮ THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS ⋮ Routing properties of supercubes ⋮ Comparing four classes of torus-based parallel architectures: network parameters and communication performance ⋮ Forwarding index of cube-connected cycles ⋮ On the fault-diameter of the star graph ⋮ The edge fault-diameter of Cartesian graph bundles ⋮ Unchanging the diameter ofk-aryn-cube networks with faulty vertices ⋮ Robustness of regular ring lattices based on natural connectivity ⋮ On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network ⋮ Rabin numbers of Butterfly networks ⋮ TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH ⋮ Some diameter notions in lexicographic product of graphs ⋮ Fault-tolerant routing in circulant networks and cycle prefix networks ⋮ Topological properties on the diameters of the integer simplex ⋮ Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
Cites Work
- Unnamed Item
- Hamiltonian cycles in generalized Petersen graphs
- On line disjoint paths of bounded length
- Counterexamples to theorems of Menger type for the diameter
- The crossing numbers of some generalized Petersen graphs.
- A counterexample to a conjecture on paths of bounded length
- A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
- Self-dual configurations and regular graphs
This page was built for publication: Fault diameter of interconnection networks
