Binding Number and Wheel Related Graphs

AYTAÇ V., BERBERLER Z. N.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, cilt.28, sa.1, ss.29-38, 2017 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 28 Sayı: 1
  • Basım Tarihi: 2017
  • Doi Numarası: 10.1142/s0129054117500034
  • Dergi Adı: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.29-38
  • Anahtar Kelimeler: Binding number, vulnerability, network design and communication, gear graph, helm, sunflower, friendship graph, RUPTURE DEGREE
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

The binding number of a graph G is defined to be the minimum of vertical bar N (S)vertical bar/vertical bar S vertical bar taken over all nonempty S subset of (G) such that N (S) not equal V (G). Binding number, one indicator to better understand graph, is an important characteristic quantity of a graph. In this paper, the relationships between the binding number and some other graph vulnerability parameters, namely the toughness, integrity, rupture degree and scattering number, are established. Exact values for the binding numbers of wheel related graphs namely gear, helm, sunflower and friendship graph are obtained.