Relations between average shortest path length and another centralities in graphs
Social and Information Networks
2024-12-23 v3 Combinatorics
Abstract
Relations between average shortest path length and average clustering coefficient, radiality, closeness and stress centralities were obtained for simple graphs.
Cite
@article{arxiv.2412.03601,
title = {Relations between average shortest path length and another centralities in graphs},
author = {Mikhail Tuzhilin},
journal= {arXiv preprint arXiv:2412.03601},
year = {2024}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2407.18275