The average binding number of graphs

Creative Commons License

ASLAN E.

ScienceAsia, cilt.45, sa.1, ss.85-91, 2019 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 45 Sayı: 1
  • Basım Tarihi: 2019
  • Doi Numarası: 10.2306/scienceasia1513-1874.2019.45.085
  • Dergi Adı: ScienceAsia
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.85-91
  • Anahtar Kelimeler: Average lower connectivity, Connectivity, Graph vulnerability, Network design and communication
  • Manisa Celal Bayar Üniversitesi Adresli: Evet

Özet

The binding number is a measure of the vulnerability of a graph. We investigate a refinement that involves the average of this parameter. Like the binding number itself, the average binding number bindav(G) of G measures the vulnerability of a graph, which is more sensitive. In this study, some bounds of the average binding number of some special graphs are obtained. Furthermore some results about the average binding number of graphs obtained from graph operations are also provided.