Relationships between vertex attack tolerance and other vulnerability parameters
| Autor: | Tufan Turaci, Vecdi Aytaç |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Connected component
Vertex (graph theory) Attack tolerance General Mathematics Binding number 02 engineering and technology 01 natural sciences 010305 fluids & plasmas Computer Science Applications Combinatorics 0103 physical sciences 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Undirected graph Software Mathematics |
| Zdroj: | RAIRO - Theoretical Informatics and Applications. 51:17-27 |
| ISSN: | 1290-385X 0988-3754 |
| DOI: | 10.1051/ita/2017005 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|