Fault diameter of interconnection networks
From MaRDI portal
Recommendations
Cites work
- A counterexample to a conjecture on paths of bounded length
- A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
- Counterexamples to theorems of Menger type for the diameter
- Hamiltonian cycles in generalized Petersen graphs
- scientific article; zbMATH DE number 3575605 (Why is no real title available?)
- On line disjoint paths of bounded length
- Self-dual configurations and regular graphs
- The crossing numbers of some generalized Petersen graphs.
Cited in
(45)- Forwarding index of cube-connected cycles
- The edge fault-diameter of Cartesian graph bundles
- Large fault-tolerant interconnection networks
- Stirling networks: A versatile combinatorial topology for multiprocessor systems
- On the fault-diameter of the star graph
- Rabin numbers of Butterfly networks
- Fault-tolerant routing in circulant networks and cycle prefix networks
- Combinatorial properties of generalized hypercube graphs
- The vulnerability of the diameter of folded \(n\)-cubes
- On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
- Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
- The fault-diameter and wide-diameter of twisted hypercubes
- Restricted fault diameter of hypercube networks
- Topological properties on the diameters of the integer simplex
- Topological properties of star graphs
- A unified formulation of Kautz network and generalized hypercube
- Lower bounds for the Estrada index using mixing time and Laplacian spectrum
- Mixed fault diameter of Cartesian graph bundles
- The fault-diameter of Cartesian products
- Robustness of random graphs based on graph spectra
- Robustness of regular ring lattices based on natural connectivity
- Some network topological notions of the Mycielskian of a graph
- A diagnosis algorithm by using graph-coloring under the PMC model
- Fault-tolerant diameter for three family interconnection networks
- The diameter vulnerability of the generalized Petersen graph \(GP[tk,k]\)
- Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
- Unchanging the diameter of k-ary n-cube networks with faulty vertices
- Some diameter notions in lexicographic product
- Some diameter notions of Fibonacci cubes
- The optimal design of low-latency virtual backbones
- Topological properties of the (n,k)-star graph
- The diameter variability of the Cartesian product of graphs
- Comparing four classes of torus-based parallel architectures: network parameters and communication performance
- Routing properties of supercubes
- Edge-fault diameter of C₄-free graphs
- Bounds on the fault-diameter of graphs
- The wide diameter and fault diameter of exchanged crossed cube
- Reliability measures in brother trees
- On the diameter of hypercubes with star structure faults
- Embedding crossed cube into diverse product graphs and tree-derived architectures
- Structure fault diameter of hypercubes
- Fault diameter of Cartesian product graphs
- Edge, vertex and mixed fault diameters
- Fault-diameter of Cartesian graph bundles
- Fault diameter of product graphs
This page was built for publication: Fault diameter of interconnection networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101090)