Open Access
2014 The Average Lower Connectivity of Graphs
Ersin Aslan
J. Appl. Math. 2014: 1-4 (2014). DOI: 10.1155/2014/807834


For a vertex v of a graph G, the lower connectivity, denoted by sv(G), is the smallest number of vertices that contains v and those vertices whose deletion from G produces a disconnected or a trivial graph. The average lower connectivity denoted by κav(G) is the value (vVGsvG)/VG. It is shown that this parameter can be used to measure the vulnerability of networks. This paper contains results on bounds for the average lower connectivity and obtains the average lower connectivity of some graphs.


Download Citation

Ersin Aslan. "The Average Lower Connectivity of Graphs." J. Appl. Math. 2014 1 - 4, 2014.


Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07010757
MathSciNet: MR3170448
Digital Object Identifier: 10.1155/2014/807834

Rights: Copyright © 2014 Hindawi

Vol.2014 • 2014
Back to Top