We present new values and bounds on the (normalised) closeness centrality \(\bar{\textsf{C}}_C\) of connected graphs and on its product \(\bar{l}\bar{\textsf{C}}_C\) with the mean distance \(\bar{l}\) of these graphs. Our main result presents the fundamental bounds \(1\le \bar{l}\bar{\textsf{C}}_C<2\) . We prove that the lower bound is tight and that the upper bound is asymptotically tight. Combining the lower bound with known upper bounds on the mean distance, we find ten new lower bounds for the closeness centrality of graphs. We also present explicit expressions for \(\bar{\textsf{C}}_C\) and \(\bar{l}\bar{\textsf{C}}_C\) for specific families of graphs. Elegantly and perhaps surprisingly, the asymptotic values of \(n\bar{\textsf{C}}_C\) for paths \(P_n\) and ladder graphs \(L_n\) are both equal to \(\pi \) , and the asymptotic limits of \(\bar{l}\bar{\textsf{C}}_C\) for these families of graphs are both equal to \(\pi /3\) . We conjecture that the set of values \(\bar{l}\bar{\textsf{C}}_C\) for all connected graphs is dense in the interval [1, 2).
