On the fault-tolerant diameter and wide diameter of ?-connected graphs

DOI10.1002/net.20054zbMath1066.68101OpenAlexW4236838735MaRDI QIDQ4667717

Cheng Zhong, Jian Hua Yin, Jiong-Sheng Li, Guo-Liang Chen

Publication date: 21 April 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20054

zbMATH Keywords

interconnection networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (8)

Edge, vertex and mixed fault diameters ⋮ Property P_d,m and efficient design of reliable networks ⋮ Edge-fault diameter of \(C_4\)-free graphs ⋮ Models and methods for solving the problem of network vulnerability ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ On robust clusters of minimum cardinality in networks ⋮ Topological properties on the diameters of the integer simplex

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On the fault-tolerant diameter and wide diameter of ?-connected graphs