The edge fault-diameter of Cartesian graph bundles

DOI10.1016/j.ejc.2008.09.004zbMath1188.05057OpenAlexW1975921792MaRDI QIDQ1024302

Rija Erveš, Janez Žerovnik, Iztok Banič

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.09.004

zbMATH Keywords

Cartesian graph boundleedge fault-diameter

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (6)

Edge, vertex and mixed fault diameters ⋮ On strong graph bundles ⋮ Graph bundles and Ricci‐flatness ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ Topological properties on the diameters of the integer simplex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generalized twisted cubes
• Fault diameter of Cartesian product graphs
• Fault-diameter of Cartesian graph bundles
• Fault diameter of 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
• Recognizing weighted directed cartesian graph bundles
• Edge Fault-Diameter of Cartesian Product of Graphs
• On recognizing Cartesian graph bundles

This page was built for publication: The edge fault-diameter of Cartesian graph bundles