Link Vulnerability in Networks

BERBERLER Z. N., Yigit E.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, cilt.29, sa.3, ss.447-456, 2018 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 29 Sayı: 3
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1142/s0129054118500144
  • Dergi Adı: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.447-456
  • Anahtar Kelimeler: Complex networks, vulnerability, network topologies, graph theory, closeness, RESIDUAL CLOSENESS, RUPTURE DEGREE, GRAPHS
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

Link residual closeness is reported as a new graph vulnerability measure, a graph-based approach to network vulnerability analysis, and more sensitive than some other existing vulnerability measures. Residual closeness is of great theoretical and practical significance to network design and optimization. In this paper, how some of the graph types perform when they suffer a link failure is discussed. Vulnerability of graphs to the failure of individual links is computed via link residual closeness which provides a much fuller characterization of the network.