| Home  | About ScienceAsia  | Publication charge  | Advertise with us  | Subscription for printed version  | Contact us  
Editorial Board
Journal Policy
Instructions for Authors
Online submission
Author Login
Reviewer Login
Volume 45 Number 1
Volume 44 Number 6
Volume 44 Number 5
Volume 44 Number 4
Volume 44 Number 3
Volume 44 Number 2
Earlier issues
Volume 44 Number 6 Volume 45 Number 1

previous article next article

Research articles

ScienceAsia 45(2019): 85-91 |doi: 10.2306/scienceasia1513-1874.2019.45.085


The average binding number of graphs


Ersin Aslan

 
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.

Download PDF

16 Downloads 26 Views


a Department of Software Engineering, Celal Bayar University, Turgutlu-Manisa, Turkey

* Corresponding author, E-mail: ersin.aslan@cbu.edu.tr

Received 29 Sep 2018, Accepted 3 Jan 2019