Link Residual Closeness of Harary Graphs
Discrete Mathematics
2026-04-08 v2
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.
Cite
@article{arxiv.2305.16882,
title = {Link Residual Closeness of Harary Graphs},
author = {Ch. Dangalchev},
journal= {arXiv preprint arXiv:2305.16882},
year = {2026}
}
Comments
15 pages