Let's take a graph, g. The fairness of vertex a in graph g is defined as the sum of vertex a's distance from other vertices. Note that the centrality of a particular vertex quantifies its total distance from all the other vertices.

The opposite of fairness is closeness.