DMFeb 25, 2024
Link Residual Closeness of Harary Graphs
arXiv:2305.168821 citationsh-index: 7
AI Analysis
Provides a theoretical result for a specific class of graphs, which is incremental for graph theory researchers.
The paper calculates the link residual closeness of Harary graphs, a measure of network vulnerability. No concrete numerical results are provided in the abstract.
The study of networks characteristics is an important subject in different fields, like math, chemistry, transportation, social network analysis etc. The residual closeness is one of the most sensitive measure of graphs vulnerability. In this article we calculate the link residual closeness of Harary graphs.