Fault-diameter of Cartesian graph bundles
From MaRDI portal
Publication:845824
DOI10.1016/j.ipl.2006.05.010zbMath1185.05121MaRDI QIDQ845824
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.05.010
68R10: Graph theory (including graph drawing) in computer science
05C76: Graph operations (line graphs, products, etc.)
Related Items
Unchanging the diameter ofk-aryn-cube networks with faulty vertices, Edge-fault diameter of \(C_4\)-free graphs, Fault-tolerant diameter for three family interconnection networks, Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles, Edge, vertex and mixed fault diameters, Fault diameter of product graphs, Distance-residual subgraphs, Wide diameter of Cartesian graph bundles, Connectivity of Cartesian products of graphs, The edge fault-diameter of Cartesian graph bundles, On strong graph bundles, Mixed fault diameter of Cartesian graph bundles, The fault-diameter of Cartesian products
Cites Work
- Unnamed Item
- Unnamed Item
- On generalized twisted cubes
- Fault diameter of Cartesian product graphs
- Fault diameter of interconnection networks
- Fault-tolerant routing in circulant networks and cycle prefix networks
- 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