Rupture degree of graphs

DOI10.1080/00207160412331336062zbMath1074.05053OpenAlexW1971499400MaRDI QIDQ5466760

Yin-Kui Li, Sheng Gui Zhang, Xue Liang Li

Publication date: 25 August 2005

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160412331336062

zbMATH Keywords

network vulnerabilityNordhaus-Gaddum type resultrupture degree

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (25)

Weak-Rupture Degree of Graphs ⋮ Neighbor Rupture Degree of Harary Graphs ⋮ The scattering number of strictly chordal graphs: linear time determination ⋮ Graph operations and neighbor rupture degree ⋮ Extremal graphs with given order and the rupture degree ⋮ On agglomeration-based rupture degree in networks and a heuristic algorithm ⋮ Isolated Rupture in Composite Networks ⋮ Computational complexity of network vulnerability analysis ⋮ Isolated Rupture in Thorny Networks ⋮ ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS ⋮ Binding Number and Wheel Related Graphs ⋮ A Note on the Link Residual Closeness of Graphs Under Join Operation ⋮ Vulnerability of nearest neighbor graphs ⋮ The rupture degree of trees ⋮ On edge-rupture degree of graphs ⋮ Extreme tenacity of graphs with given order and size ⋮ Graph vulnerability parameters, compression, and quasi-threshold graphs ⋮ Edge Rupture Degree of Graphs ⋮ Link Vulnerability in Networks ⋮ COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS ⋮ Vulnerability parameters of split graphs ⋮ A polynomial algorithm for computing the weak rupture degree of trees ⋮ Bounds for scattering number and rupture degree of graphs with genus ⋮ Relationships between rupture degree and other parameters ⋮ Tree-core and tree-coritivity of graphs

Cites Work

• On a class of posets and the corresponding comparability graphs
• Tough graphs and Hamiltonian circuits.
• Unnamed Item
• Unnamed Item

This page was built for publication: Rupture degree of graphs