SOME RESULTS FOR THE RUPTURE DEGREE

DOI10.1142/S0129054113500366zbMath1296.05102MaRDI QIDQ5168420

Hanife Aksu, Aysun Aytaç

Publication date: 4 July 2014

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

zbMATH Keywords

networksconnectivityvulnerabilityrupture degree

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40)

Related Items (1)

On agglomeration-based rupture degree in networks and a heuristic algorithm

Cites Work

• A survey of integrity
• Tough graphs and Hamiltonian circuits.
• Scattering number in graphs
• Sufficient conditions for equality of connectivity and minimum degree of a graph
• The scattering number of thorn graphs

This page was built for publication: SOME RESULTS FOR THE RUPTURE DEGREE