Let
Accepté le :
DOI : 10.1051/ita/2017005
Mots-clés : Graph vulnerability, vertex attack tolerance, connectivity, network design and communication, toughness, integrity, scattering number, tenacity, binding number, rupture degree
@article{ITA_2017__51_1_17_0, author = {Ayta\c{c}, Vecdi and Turaci, Tufan}, title = {Relationships between vertex attack tolerance and other vulnerability parameters}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {17--27}, publisher = {EDP-Sciences}, volume = {51}, number = {1}, year = {2017}, doi = {10.1051/ita/2017005}, mrnumber = {3678027}, zbl = {1369.05124}, language = {en}, url = {http://www.numdam.org/articles/10.1051/ita/2017005/} }
TY - JOUR AU - Aytaç, Vecdi AU - Turaci, Tufan TI - Relationships between vertex attack tolerance and other vulnerability parameters JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2017 SP - 17 EP - 27 VL - 51 IS - 1 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/ita/2017005/ DO - 10.1051/ita/2017005 LA - en ID - ITA_2017__51_1_17_0 ER -
%0 Journal Article %A Aytaç, Vecdi %A Turaci, Tufan %T Relationships between vertex attack tolerance and other vulnerability parameters %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2017 %P 17-27 %V 51 %N 1 %I EDP-Sciences %U http://www.numdam.org/articles/10.1051/ita/2017005/ %R 10.1051/ita/2017005 %G en %F ITA_2017__51_1_17_0
Aytaç, Vecdi; Turaci, Tufan. Relationships between vertex attack tolerance and other vulnerability parameters. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 51 (2017) no. 1, pp. 17-27. doi : 10.1051/ita/2017005. http://www.numdam.org/articles/10.1051/ita/2017005/
Vulnerability in graphs a comparative survey. J. Comb. Math. Comb. Comput. 1 (1987) 12–22. | MR | Zbl
, and ,M. Cozzens, D. Moazzami and S. Stueckle, The tenacity of a graph. Proc. 7th International Conference on the Theory and Applications of Graphs. Wiley, New York (1995) 1111–1122. | MR | Zbl
Tough graphs and Hamiltonian circuits. Discrete Math. 5 (1973) 215–228. | DOI | MR | Zbl
,G. Ercal, On Vertex Attack Tolerance in Regular Graphs. Preprint [cs.DM] (2014). | arXiv
Resilience notions for scale-free networks. Procedia Comput. Sci. 20 (2013) 510–515. | DOI
and .D.B. West, Introduction to Graph Theory. Prentice Hall, NJ (2001). | MR
The binding number of a graph and its Anderson number. J. Combin. Theory Ser. B 15 (1973) 225–255. | DOI | MR | Zbl
,Analysis and design of survivable Networks. IEEE Trans. Commun. Technol. 18 (1970) 501–519. | DOI | MR
and ,On maximal circuits infinite graphs. Ann. Discrete Math. 3 (1978) 129–144. | DOI | MR | Zbl
.Vulnerability of complex Networks. Commun. Nonl. Sci. Numer. Simul. 16 (2011) 341–349. | DOI | MR | Zbl
, and ,J. Matta, J. Borwey and G. Ercal, Comparative Resilience Notions and Vertex Attack Tolerance of Scale-Free Networks. Preprint [cs.SI] (2014). | arXiv
J. Matta, Comparing the Effectiveness of Resilience Measures. MSC Thesis, Southern Illinois University Edwardsville, USA (2014).
Design of survivable communication networks under performance constraints. IEEE Trans. Reliab. 40 433-440 (1991). | DOI | Zbl
and ,Rupture degree of graphs. Inter. J. Comput. Math. 82 (2005) 793–803. | DOI | MR | Zbl
, and ,Cité par Sources :