Aytac, VecdiTuraci, Tufan2024-09-292024-09-2920170988-37541290-385Xhttps://doi.org/10.1051/ita/2017005https://hdl.handle.net/20.500.14619/5530Let 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.eninfo:eu-repo/semantics/openAccessGraph vulnerabilityvertex attack toleranceconnectivitynetwork design and communicationtoughnessintegrityscattering numbertenacitybinding numberrupture degreeArticle10.1051/ita/20170052-s2.0-85022227966271Q21751WOS:000405570600003Q4