Relationships between vertex attack tolerance and other vulnerability parameters

¹ Computer Engineering Department Faculty of Engineering, Ege University, 35100, Bornova-IZMIR, Turkey
vecdi.aytac@ege.edu.tr
² Department of Mathematics, Faculty of Science, Karabük University, 78050, Karabük, Turkey
tufanturaci@karabuk.edu.tr

Received: 17 August 2016
Accepted: 6 February 2017

Abstract

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-C_max (G-S)|+1 : S ⊂ V} , where C_max(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.