TL;DR
This paper analyzes various closeness-based metrics in lollipop graphs, providing detailed calculations that enhance understanding of their robustness and growth potential in network analysis.
Contribution
It introduces explicit calculations of multiple closeness measures specifically for lollipop graphs, advancing the understanding of their structural properties.
Findings
Calculated closeness, residual closeness, and additional closeness for lollipop graphs.
Provides insights into the robustness and growth potential of these graphs.
Enhances network analysis tools for specific graph structures.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.