The average binding number of graphs

Creative Commons License

ASLAN E.

ScienceAsia, vol.45, no.1, pp.85-91, 2019 (SCI-Expanded, Scopus) identifier

  • Publication Type: Article / Article
  • Volume: 45 Issue: 1
  • Publication Date: 2019
  • Doi Number: 10.2306/scienceasia1513-1874.2019.45.085
  • Journal Name: ScienceAsia
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.85-91
  • Keywords: Average lower connectivity, Connectivity, Graph vulnerability, Network design and communication
  • Open Archive Collection: AVESIS Open Access Collection
  • Manisa Celal Bayar University Affiliated: Yes

Abstract

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.