Aytaç A.Öztürk H.A.2019-10-262019-10-2620181562-83531562-8353https://hdl.handle.net/11454/16012Vulnerability is an important concept in network analysis. When a failure occurs in some of the components of the network, vulnerability measures the ability of the network to disruption in order to avoid the external or internal effects. Graph theory is an important concept in network vulnerability analysis. If a network is modeled as an undirected and unweighted graph composed of processing vertices and communication links, there have been several proposals for measuring graph vulnerability under link or vertex failures. In this paper, we consider the concept of average edge betweenness of a graph in order to measure the network stability. The average edge betweenness is related to the edge betweenness of an edge. The edge betweenness of a given edge is the fraction of shortest paths, counted over all pairs of vertices that pass through that edge. The average edge betweenness considers both the local and the global structure of the graph. In this paper, we obtain exact values for average edge betweenness and normalized average edge betweenness for some special graphs and Ep t graph. © 2018 InforMath Publishing Group.eninfo:eu-repo/semantics/closedAccessAverage edge betweennessNetwork design and communicationNetwork vulnerabilityStabilityArticle183241252Q3