Closeness Centralities of Lollipop Graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911936998801408 |
|---|---|
| author | Dangalchev, Chavdar |
| author_facet | Dangalchev, Chavdar |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_06738 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Closeness Centralities of Lollipop Graphs Dangalchev, Chavdar Discrete Mathematics Combinatorics 90C35, 05C35, 05C09 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. |
| title | Closeness Centralities of Lollipop Graphs |
| topic | Discrete Mathematics Combinatorics 90C35, 05C35, 05C09 |
| url | https://arxiv.org/abs/2307.06738 |