The Average Lower Connectivity of Graphs
Author
Source
Journal of Applied Mathematics
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-4, 4 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-02-12
Country of Publication
Egypt
No. of Pages
4
Main Subjects
Abstract EN
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 (∑v∈VGsvG)/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.
American Psychological Association (APA)
Aslan, Ersin. 2014. The Average Lower Connectivity of Graphs. Journal of Applied Mathematics،Vol. 2014, no. 2014, pp.1-4.
https://search.emarefa.net/detail/BIM-499688
Modern Language Association (MLA)
Aslan, Ersin. The Average Lower Connectivity of Graphs. Journal of Applied Mathematics No. 2014 (2014), pp.1-4.
https://search.emarefa.net/detail/BIM-499688
American Medical Association (AMA)
Aslan, Ersin. The Average Lower Connectivity of Graphs. Journal of Applied Mathematics. 2014. Vol. 2014, no. 2014, pp.1-4.
https://search.emarefa.net/detail/BIM-499688
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-499688