A comparison between edge neighbor rupture degree and edge scattering number in graphs

Kürkçü Ö. K., ASLAN E.

International Journal of Foundations of Computer Science, cilt.29, sa.7, ss.1119-1142, 2018 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 29 Sayı: 7
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1142/s0129054118500247
  • Dergi Adı: International Journal of Foundations of Computer Science
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1119-1142
  • Anahtar Kelimeler: Edge neighbor rupture degree, Edge scattering number, Graph operations, Network design, Vulnerability
  • Manisa Celal Bayar Üniversitesi Adresli: Evet

Özet

The vulnerability measure of a graph or a network depends on robustness of the remained graph, after being exposed to any intervention or attack. In this paper, we consider two edge vulnerability parameters that are the edge neighbor rupture degree and the edge scattering number. The values of these parameters of some specific graphs and their graph operations are calculated. Thus, we analyze and compare which parameter is distinctive for the different type of graphs by using tables.