RELATIONSHIPS BETWEEN VERTEX ATTACK TOLERANCE AND OTHER VULNERABILITY PARAMETERS
Küçük Resim Yok
Tarih
2017
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Edp Sciences S A
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
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.
Açıklama
Anahtar Kelimeler
Graph vulnerability, vertex attack tolerance, connectivity, network design and communication, toughness, integrity, scattering number, tenacity, binding number, rupture degree
Kaynak
Rairo-Theoretical Informatics and Applications
WoS Q Değeri
Q4
Scopus Q Değeri
Q2
Cilt
51
Sayı
1
