Closeness Centralities of Lollipop Graphs
Discrete Mathematics
2024-07-02 v3 Combinatorics
Abstract
Closeness is one of the most studied characteristics of networks. Residual closeness is a very sensitive measure of graphs robustness. Additional closeness is a measure of growth potentials of networks. In this article we calculate the closeness, vertex residual closeness, link residual closeness, and additional closeness of lollipop graphs.
Keywords
Cite
@article{arxiv.2307.06738,
title = {Closeness Centralities of Lollipop Graphs},
author = {Chavdar Dangalchev},
journal= {arXiv preprint arXiv:2307.06738},
year = {2024}
}