Mixed fault diameter of Cartesian graph bundles
From MaRDI portal
Publication:2446299
DOI10.1016/j.dam.2011.11.020zbMath1286.05038OpenAlexW2092811499MaRDI QIDQ2446299
Publication date: 16 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.020
Related Items (6)
The vulnerability of the diameter of the enhanced hypercubes ⋮ On strong graph bundles ⋮ Graph bundles and Ricci‐flatness ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ Topological properties on the diameters of the integer simplex ⋮ Perfect codes in direct graph bundles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generalized twisted cubes
- Fault diameter of Cartesian product graphs
- Edge, vertex and mixed fault diameters
- Fault-diameter of Cartesian graph bundles
- The edge fault-diameter of Cartesian graph bundles
- Fault diameter of interconnection networks
- Large fault-tolerant interconnection networks
- Fault-tolerant routing in circulant networks and cycle prefix networks
- Unique square property and fundamental factorizations of graph bundles
- Recognizing Cartesian graph bundles
- Multiplicative circulant networks. Topological properties and communication algorithms
- Algorithm for recognizing Cartesian graph bundles
- Edge-colorability of graph bundles
- On the diameter vulnerability of Kautz digraphs
- The fault-diameter of Cartesian products
- On the construction of combinedk-fault-tolerant Hamiltonian graphs
- Recognizing weighted directed cartesian graph bundles
- On the fault-tolerant diameter and wide diameter of ?-connected graphs
- Edge Fault-Diameter of Cartesian Product of Graphs
- The ILLIAC IV Computer
- On recognizing Cartesian graph bundles
This page was built for publication: Mixed fault diameter of Cartesian graph bundles
