The weak rupture degree of graphs

DOI10.16152/J.CNKI.XDXBZR.2017-06-003MaRDI QIDQ3175377zbMATH OpenFDO

Authors Zongtian Wei, Chao Yue, Yong Liu, Yinkui Li, Jingting Yang

Publication date 18 July 2018

Full work available at URL https://doi.org/10.16152/J.CNKI.XDXBZR.2017-06-003

zbMATH Keywords

invulnerabilitynetworkweak rupture degree

Mathematics Subject Classification ID

Connectivity (05C40) Density (toughness, etc.) (05C42) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial optimization (90C27)

Recommendations

• The weak rupture degree of graphs and the network invulnerability
• Weak-rupture degree of graphs
• Rupture degree of graphs
• Some results for the rupture degree
• A polynomial algorithm for computing the weak rupture degree of trees

Cited in

(8)

• A polynomial algorithm for computing the weak rupture degree of trees
• scientific article; zbMATH DE number 989237 (Why is no real title available?)
• The weak rupture degree of graphs and the network invulnerability
• COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS
• scientific article; zbMATH DE number 6847548 (Why is no real title available?)
• Edge Rupture Degree of Graphs
• Weak-rupture degree of graphs
• Weak degeneracy of graphs

This page was built for publication: The weak rupture degree of graphs

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