Fault diameter of product graphs

DOI10.1016/j.ipl.2007.01.001zbMath1185.05054OpenAlexW2157310458MaRDI QIDQ846012

Jun-Ming Xu, Chao Yang

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.2007.01.001

zbMATH Keywords

combinatoricsdiameterfault diameterpermutation graphsproduct graphsCartesian graph bundlesCartesian graphs

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Large graphs with given degree and diameter. II
• Fault diameter of Cartesian product graphs
• Fault-diameter of Cartesian graph bundles
• Fault diameter of interconnection networks
• Edge-colorability of graph bundles
• Reliability of interconnection networks modeled by a product of graphs
• Theory and Application of Graphs

This page was built for publication: Fault diameter of product graphs