# Dangalchev Closeness Centrality

#### Definition

The Dangalchev Closeness Centrality define as:
where d(i, j) is the is the distance between vertices i and j.

The calculations of this variation of closeness will be easier and we can use this definition for not connected graphs too.

The calculations of this variation of closeness will be easier and we can use this definition for not connected graphs too.

**See Residual Closeness Centrality**#### Requirements

Calculable in connected and not connected network.

#### References

- DANGALCHEV, C. 2006. Residual closeness in networks. Physica A: Statistical Mechanics and its Applications, 365, 556-564. DOI: 10.1016/j.physa.2005.12.020