Fault-diameter of Cartesian graph bundles

DOI10.1016/j.ipl.2006.05.010zbMath1185.05121OpenAlexW2006450261MaRDI QIDQ845824

Iztok Banič, Janez Žerovnik

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

zbMATH Keywords

diameterinterconnection networksfault-tolerancegraph bundleCartesian graph product

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76)

Related Items (14)

Edge, vertex and mixed fault diameters ⋮ Fault diameter of product graphs ⋮ On strong graph bundles ⋮ Edge-fault diameter of \(C_4\)-free graphs ⋮ Graph bundles and Ricci‐flatness ⋮ Fault-tolerant diameter for three family interconnection networks ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ The fault-diameter of Cartesian products ⋮ Distance-residual subgraphs ⋮ Wide diameter of Cartesian graph bundles ⋮ Connectivity of Cartesian products of graphs ⋮ The edge fault-diameter of Cartesian graph bundles ⋮ Unchanging the diameter ofk-aryn-cube networks with faulty vertices

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

This page was built for publication: Fault-diameter of Cartesian graph bundles