Relations between average clustering coefficient and another centralities in graphs

TL;DR

This paper explores the relationships between the average clustering coefficient and various centrality measures in simple graphs, providing insights into their interdependencies.

Contribution

It presents new analytical relations between average clustering coefficient and multiple centrality metrics in simple graphs.

Findings

Identified specific relations between clustering coefficient and centralities.

Provided formulas linking clustering with global efficiency and other measures.

Enhanced understanding of graph structure properties.

Abstract

Relations between average clustering coefficient and global clustering coefficient, local efficiency, radiality, closeness, betweenness and stress centralities were obtained for simple graphs.