Relationships between vertex attack tolerance and other vulnerability parameters
Articles > Article · 2017
Authors: Vecdi AYTAÇ, TUFAN TURACI
RAIRO - Theoretical Informatics and Applications, Journal Indexed in SCI Expanded, International, WoS, 2017, vol 51, pp 17-27
DOI: 10.1051/ita/2017005
Summary
Let G(V,E) be a simple undirected graph. Recently, the vertex attack tolerance (VAT) of G has been defined as τ(G) = min {|S| / |V-S-Cmax (G-S)|+1 : S ⊂ V} , where Cmax(G − S) is the order of a largest connected component in G − S. This parameter has been used to measure the vulnerability of networks. The vertex attack tolerance is the only measure that fully captures both the major bottlenecks of a network and the resulting component size distribution upon targeted node attacks. In this article, the relationships between the vertex attack tolerance and some other vulnerability parameters, namely connectivity, toughness, integrity, scattering number, tenacity, binding number and rupture degree have been determined.