Weak-rupture degree of graphs

DOI10.1142/S0129054116500258MaRDI QIDQ5298310zbMATH OpenOpenAlexFDO

Authors Ersin Aslan

Publication date 14 December 2016

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

connectivitygraph theorynetwork design and communicationrupture degreeweak integrity

Mathematics Subject Classification ID

Connectivity (05C40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The weak rupture degree of graphs
• Some results for the rupture degree
• Rupture degree of graphs
• The rupture degree of some graphs
• scientific article; zbMATH DE number 6847548

Cites work

• A survey of integrity
• Edge-neighbor-rupture degree of graphs
• On the weak-integrity of graphs
• Rupture degree of graphs
• Tenacity of complete graph products and grids

Cited in

(11)

• A polynomial algorithm for computing the weak rupture degree of trees
• The weak rupture degree of graphs
• 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
• Some results for the rupture degree
• scientific article; zbMATH DE number 6453262 (Why is no real title available?)
• Weak degeneracy of graphs
• On agglomeration-based rupture degree in networks and a heuristic algorithm
• On the average lower bondage number of graphs under join and corona operations

This page was built for publication: Weak-rupture degree of graphs

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