Sharp bounds and characterizations for cut-component numbers of graphs

DOI10.1016/J.DAM.2026.05.002MaRDI QIDQ7289262zbMATH OpenFDO

Authors Ji Li, Yuefang Sun, Junran Yu, Xuemei You, Xiaoyan Zhang

Publication date 2 July 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.05.002

Mathematics Subject Classification ID

Connectivity (05C40) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cites work

• A Generalized Theory for System Level Diagnosis
• A note on Hamiltonian circuits
• A survey of Nordhaus-Gaddum type relations
• Algorithm design
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• Characterization of Connection Assignment of Diagnosable Systems
• Diagnosability of regular systems
• Diagnosable Systems for Intermittent Faults
• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• scientific article; zbMATH DE number 3338394 (Why is no real title available?)
• Maximal Flow Through a Network
• On \(g\)-good-neighbor conditional diagnosability of \((n,k)\)-star networks
• On diagnosability of large fault sets in regular topology-based computer systems
• On diagnosability of large multiprocessor networks
• On Fault Identification in Diagnosable Systems
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• System Diagnosis with Repair
• The \(g\)-good-neighbor conditional diagnosability of locally twisted cubes
• The \(g\)-good-neighbor diagnosability of \((n,k)\)-star graphs

This page was built for publication: Sharp bounds and characterizations for cut-component numbers of graphs

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