The Average Lower Connectivity of Graphs

Abstract

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∈V(G) sV(G))/|V(G)|. It is shown that this parameter can be used to measure the… (More)
DOI: 10.1155/2014/807834

Topics

3 Figures and Tables

Slides referencing similar topics