The weak rupture degree of graphs and the network invulnerability

DOI10.3969/J.ISSN.1005-3085.2021.03.006MaRDI QIDQ3380862zbMATH OpenFDO

Authors Yong Liu, Shushu Yang, Zongtian Wei, Chao Yue

Publication date 29 September 2021

zbMATH Keywords

combinatorial optimizationweak rupture degreenetwork invulnerability

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40)

Recommendations

• The weak rupture degree of graphs
• Weak-rupture degree of graphs
• Neighbor rupture degree and the relations between other parameters.
• The relationship between rupture degree and other vulnerability parameters
• On edge-rupture degree of graphs

Cited in

(4)

• scientific article; zbMATH DE number 6453262 (Why is no real title available?)
• A polynomial algorithm for computing the weak rupture degree of trees
• The weak rupture degree of graphs
• Isolated Rupture in Composite Networks

This page was built for publication: The weak rupture degree of graphs and the network invulnerability

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