Journal of Applied Mathematics
- J. Appl. Math.
- Volume 2014 (2014), Article ID 807834, 4 pages.
The Average Lower Connectivity of Graphs
For a vertex of a graph , the lower connectivity, denoted by , is the smallest number of vertices that contains and those vertices whose deletion from produces a disconnected or a trivial graph. The average lower connectivity denoted by is the value . 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.
J. Appl. Math., Volume 2014 (2014), Article ID 807834, 4 pages.
First available in Project Euclid: 2 March 2015
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Aslan, Ersin. The Average Lower Connectivity of Graphs. J. Appl. Math. 2014 (2014), Article ID 807834, 4 pages. doi:10.1155/2014/807834. https://projecteuclid.org/euclid.jam/1425305527