Connectivity and Diagnosability of Leaf-Sort Graphs

DOI10.1142/S0129626420400046MaRDI QIDQ5087057zbMATH OpenFDO

Authors Mujiangshan Wang, Dong Xiang, Shiying Wang

Publication date 8 July 2022

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

Full work available at URL https://doi.org/10.1142/S0129626420400046

zbMATH Keywords

connectivitydiagnosabilityinterconnection networkleaf-sort graph

Mathematics Subject Classification ID

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

Recommendations

• The connectivities of leaf graphs of 2-connected graphs
• The connectivities of leaf graphs of sets of points in the plane
• scientific article; zbMATH DE number 1109399
• On k-leaf-connected graphs
• On connectivities of tree graphs
• Onk-leaf connectivity of a random graph
• On the connectivity of configuration graphs
• Connectivity and tree structure in finite graphs
• scientific article; zbMATH DE number 4051653
• Leaf-critical and leaf-stable graphs

Cites work

• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• Graph theory
• scientific article; zbMATH DE number 3458752 (Why is no real title available?)
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• The g-good-neighbor and g-extra diagnosability of networks

Cited in

(1)

• One-to-one disjoint-path covers of leaf-sort graphs

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

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