Edge-neighbor-rupture degree of graphs

ASLAN E.

Journal of Applied Mathematics, cilt.2013, 2013 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 2013
  • Basım Tarihi: 2013
  • Doi Numarası: 10.1155/2013/783610
  • Dergi Adı: Journal of Applied Mathematics
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Manisa Celal Bayar Üniversitesi Adresli: Evet

Özet

The edge-neighbor-rupture degree of a connected graph G is defined to be ENRG=maxωG-S-S-mG-S:SEG,ωG-S≥1, where S is any edge-cut-strategy of G, ωG-S is the number of the components of G-S, and mG-S is the maximum order of the components of G-S. In this paper, the edge-neighbor-rupture degree of some graphs is obtained and the relations between edge-neighbor-rupture degree and other parameters are determined. © 2013 Ersin Aslan.