Link Residual Closeness of Harary Graphs

Article type: Research Article

Authors: Dangalchev, Chavdar^{; *}

Affiliations: Bulgarian Academy of Sciences, Institute of Mathematics and Informatics, Bulgaria. [email protected]

Correspondence: [*] Address for correspondence: Bulgarian Academy of Sciences, Institute of Mathematics and Informatics, Bulgaria.

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.

Keywords: Closeness, Residual Closeness, Harary Graphs

DOI: 10.3233/FI-242170

Journal: Fundamenta Informaticae, vol. 191, no. 1, pp. 1-15, 2024