Uniform Edge Betweenness Centrality

Abstract

The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In this paper, we investigate graphs where the edge betweenness centrality of edges is uniform.It is clear that if a graph G is edge-transitive (its automorphism group acts transitively on its edges) then G has uniform edge betweenness centrality. However this sufficient condition is not necessary. Graphs that are not edge-transitive but have uniform edge betweenness centrality appear to be very rare. Of the over 11.9 million connected graphs on up to ten vertices, there are only four graphs that are not edge-transitive but have uniform edge betweenness centrality. Despite this rarity among small graphs, we present methods for creating infinite classes of graphs with this unusual combination of properties.Case 5b: v = a − a mod(6n − 1) + 3 − 6n Note that v = 12n or v = 2 or v = 6n + 1. By definition of E, N (v) = {v + 6n, v + 1} ⇒ φ(N (v)) = {φ(v) + 1, φ(v) + 6n} = N (φ(v)).