Closeness and Residual Closeness of Harary Graphs

Analysis of a network in terms of vulnerability is one of the most significant problems. Graph theory serves as a valuable tool for solving complex network problems, and there exist numerous graph-theoretic parameters to analyze the system's stability. Among these parameters, the closeness parameter stands out as one of the most commonly used vulnerability metric. Its definition has evolved over time to enhance ease of formulation and applicability to disconnected structures. Furthermore, based on the closeness parameter, residual closeness, which is a newer and more sensitive parameter compared to other existing parameters, has been introduced as a new graph vulnerability index by Dangalchev. In this study, the outcomes of the closeness and residual closeness parameters in Harary Graphs have been examined. Harary Graphs are well-known constructs that are distinguished by having $n$ vertices that are $k$-connected with the least possible number of edges.