Issue |
RAIRO-Theor. Inf. Appl.
Volume 51, Number 1, January-March 2017
|
|
---|---|---|
Page(s) | 17 - 27 | |
DOI | https://doi.org/10.1051/ita/2017005 | |
Published online | 13 April 2017 |
Relationships between vertex attack tolerance and other vulnerability parameters
1 Computer Engineering Department Faculty of Engineering, Ege University, 35100, Bornova-IZMIR, Turkey
vecdi.aytac@ege.edu.tr
2 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
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.
Mathematics Subject Classification: 05C40 / 68M10 / 68R10
Key words: Graph vulnerability / vertex attack tolerance / connectivity / network design and communication / toughness / integrity / scattering number / tenacity / binding number / rupture degree
© EDP Sciences 2017
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.