Relations between average shortest path length and another centralities in graphs

TL;DR

This paper investigates the relationships between average shortest path length and various centrality measures such as clustering coefficient, radiality, closeness, and stress in simple graphs.

Contribution

It provides analytical relations between average shortest path length and multiple centrality metrics in simple graphs.

Findings

Established formulas linking shortest path length with clustering coefficient.

Derived relations between shortest path length and radiality, closeness, stress centralities.

Enhanced understanding of how centralities influence graph efficiency.

Abstract

Relations between average shortest path length and average clustering coefficient, radiality, closeness and stress centralities were obtained for simple graphs.