Connectivity and Diagnosability of Leaf-Sort Graphs

DOI10.1142/S0129626420400046zbMath1490.68166MaRDI QIDQ5087057

Dong Xiang, Mujiangshan Wang, Shi-ying Wang

Publication date: 8 July 2022

Published in: Parallel Processing Letters (Search for Journal in Brave)

zbMATH Keywords

connectivityinterconnection networkdiagnosabilityleaf-sort graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The \(g\)-good-neighbor and \(g\)-extra diagnosability of networks
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• Optimization of Reduced Dependencies for Synchronous Sequential Machines

This page was built for publication: Connectivity and Diagnosability of Leaf-Sort Graphs