Closeness Centralities of Lollipop Graphs
From MaRDI portal
Publication:6511068
DOI10.1093/COMJNL/BXAD120arXiv2307.06738MaRDI QIDQ6511068FDOQ6511068
Authors: Chavdar Atanasov Dangalchev 
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.
Programming involving graphs or networks (90C35) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35)
This page was built for publication: Closeness Centralities of Lollipop Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6511068)
