Weak-Rupture Degree of Graphs

DOI10.1142/S0129054116500258zbMath1355.68201OpenAlexW2554246037MaRDI QIDQ5298310

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

graph theoryconnectivitynetwork design and communicationrupture degreeweak integrity

Mathematics Subject Classification ID

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

Related Items (2)

On agglomeration-based rupture degree in networks and a heuristic algorithm ⋮ On the average lower bondage number of graphs under join and corona operations

Cites Work

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

This page was built for publication: Weak-Rupture Degree of Graphs