Closeness Centralities of Lollipop Graphs

被引：2
|
作者：
Dangalchev, Chavdar [1 ]
机构：
[1] Bulgarian Acad Sci, Inst Math & Informat, Acad Georgi Bonchev Str,Block 8, Sofia 1113, Bulgaria
来源：
COMPUTER JOURNAL | 2023年 / 67卷 / 06期
关键词：
closeness; residual closeness; additional closeness; lollipop graphs; RESIDUAL CLOSENESS;
D O I：
10.1093/comjnl/bxad120
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：2020 / 2029
页数：10
相关论文
共 50 条
12345