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

Cartesian product graphconnectivitydiameterfault diameterinterconnection networks

Mathematics Subject Classification ID

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

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

• 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
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• On connectivity of the cartesian product of two graphs
• On the diameter vulnerability of Kautz digraphs
• On the Rabin number problem
• Wide diameters of butterfly networks

Cited in

(27)

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

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)