Closeness Centralities of Lollipop Graphs
Preprint
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
All Related Versions
This publication has 10 references indexed in Scilit:
- Vertex and Link Residual Closeness of Graphs of Given Fractional Matching NumberInternational Journal of Foundations of Computer Science, 2023
- Node and Link Vulnerability in Complete Multipartite NetworksInternational Journal of Foundations of Computer Science, 2023
- VULNERABILITY OF BANANA TREES VIA CLOSENESS AND RESIDUAL CLOSENESS PARAMETERSMaltepe Journal of Mathematics, 2022
- Residual Closeness of Graphs with Given ParametersJournal of the Operations Research Society of China, 2022
- Residual Closeness, Matching Number and Chromatic NumberThe Computer Journal, 2022
- Extremal Results on Vertex and Link Residual ClosenessInternational Journal of Foundations of Computer Science, 2021
- A Note on the Link Residual Closeness of Graphs Under Join OperationInternational Journal of Foundations of Computer Science, 2019
- Robustness of Regular CaterpillarsInternational Journal of Foundations of Computer Science, 2017
- Residual Closeness in Cycles and Related NetworksFundamenta Informaticae, 2013
- RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKSInternational Journal of Foundations of Computer Science, 2011