Closeness Centralities of Lollipop Graphs-Reference-Cited by-同舟云学术

Closeness Centralities of Lollipop Graphs

Published:2023-12-18 Issue: Volume: Page:
ISSN:0010-4620
Container-title:The Computer Journal
language:en
Short-container-title:

Author:

Dangalchev Chavdar¹

Affiliation:

1. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences , Acad. Georgi Bonchev Str., Block 8, 1113 Sofia , Bulgaria

Abstract

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.

Publisher

Oxford University Press (OUP)

Subject

General Computer Science

Link

https://academic.oup.com/comjnl/advance-article-pdf/doi/10.1093/comjnl/bxad120/54586193/bxad120.pdf

Reference25 articles.

1. Residual closeness in networks;Dangalchev;Phisica A,2006

2. Additional closeness and networks growth;Dangalchev;Fundam. Inform.,2020

3. Algorithms for closeness, additional closeness and residual closeness;Dangalchev;Comput. Vis. Stud.,2023

4. Additional closeness of cycle graphs;Dangalchev;IJFCS,2022

5. Closeness centrality of friendship and lollipop graphs;Barman;Innovation of Multidisciplinary Research in Present and Future Time,2023

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Link Residual Closeness of Harary Graphs;Fundamenta Informaticae;2024-03-07

2. Thematic Editorial: The Ubiquitous Network;The Computer Journal;2024-03