# Harary Graph Centrality

#### Definition

See Eccentricity Centrality

Graph centrality measures the length of the shortest path to reach the node farthest away from the given node.

The Harary graph centrality of a vertex v is equal to:

### 1/(max_{u} d(v,u))

#### References

- CARTER T. BUTTS (2014). sna: Tools for Social Network Analysis. R package version 2.3-2. http://CRAN.R-project.org/package=sna
- HAGE, P. & HARARY, F. 1995. Eccentricity and centrality in networks. Social Networks, 17, 57-63. DOI: 10.1016/0378-8733(94)00248-9