Ononot — In a network graph visualization, the 'Closeness Centrality'

Guest Session: 1 Question Remaining. Create Account to save progress.

Data Visualizationhard

0:00.0

In a network graph visualization, the 'Closeness Centrality' $C(v)$ of a node is defined as $\frac{N-1}{\sum_{u \neq v} d(v, u)}$ . For a path graph with 5 nodes ( $v_1-v_2-v_3-v_4-v_5$ ), what is the closeness centrality of the central node $v_3$ ?