Fault diameter of Cartesian product graphs

DOI10.1016/J.IPL.2004.11.005MaRDI QIDQ835042zbMATH OpenOpenAlexFDO

Authors Min Xu, Jun-Ming Xu, Xinmin Hou

Publication date 27 August 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.11.005

zbMATH Keywords

diameterconnectivityinterconnection networksfault diameterCartesian product graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Reliability, testing and fault tolerance of networks and computer systems (68M15) Fault detection; testing in circuits and networks (94C12) Network design and communication in computer systems (68M10)

Recommendations

• The fault-diameter of Cartesian products
• Fault diameter of product graphs
• Edge Fault-Diameter of Cartesian Product of Graphs
• Fault-diameter of Cartesian graph bundles
• Edge fault-diameter of graph product

Cites work

• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes
• Fault diameter of interconnection networks
• Fault-tolerant routing in circulant networks and cycle prefix networks
• Graph theory
• On connectivity of the cartesian product of two graphs
• On the Rabin number problem
• On the diameter vulnerability of Kautz digraphs
• Wide diameters of butterfly networks

Cited in

(25)

• Edge fault-diameter of graph product
• Fault-diameter of Cartesian graph bundles
• Fault diameter of product graphs
• On regular subgraphs of augmented cubes
• The vulnerability of the diameter of the enhanced hypercubes
• The fault-diameter of Cartesian products
• Unchanging the diameter of \(k\)-ary \(n\)-cube networks with faulty vertices
• Bounds on the fault-diameter of graphs
• Existence of 3-regular subgraphs in Cartesian product of cycles
• Topological properties on the diameters of the integer simplex
• scientific article; zbMATH DE number 5997381 (Why is no real title available?)
• Edge, vertex and mixed fault diameters
• On conditional connectivity of the Cartesian product of cycles
• Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
• Resource placement in Cartesian product of networks
• Decomposition of the product of cycles based on degree partition
• Fault-tolerant diameter for three family interconnection networks
• The edge fault-diameter of Cartesian graph bundles
• Edge Fault-Diameter of Cartesian Product of Graphs
• The optimal design of low-latency virtual backbones
• Edge-fault diameter of \(C_4\)-free graphs
• On 4-regular 4-connected bipancyclic subgraphs of hypercubes
• Factorizations of the product of cycles
• Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
• Mixed fault diameter of Cartesian graph bundles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835042)