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, vol.29, no.7, pp.1119-1142, 2018 (SCI-Expanded, Scopus) identifier

  • Publication Type: Article / Article
  • Volume: 29 Issue: 7
  • Publication Date: 2018
  • Doi Number: 10.1142/s0129054118500247
  • Journal Name: International Journal of Foundations of Computer Science
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.1119-1142
  • Keywords: Edge neighbor rupture degree, Edge scattering number, Graph operations, Network design, Vulnerability
  • Manisa Celal Bayar University Affiliated: Yes

Abstract

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.