Ch. Dangalchev - Link Residual Closeness of Harary Graphs

fi:11385 - Fundamenta Informaticae, March 30, 2024, Volume 191, Issue 1 - https://doi.org/10.46298/fi.11385
Link Residual Closeness of Harary GraphsArticle

Authors: Ch. Dangalchev

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.

Comment: 15 pages

https://doi.org/10.46298/fi.11385
Source: arXiv.org:2305.16882
Volume: Volume 191, Issue 1
Published on: March 30, 2024
Accepted on: December 9, 2023
Submitted on: May 29, 2023
Keywords: Computer Science - Discrete Mathematics, 90C35
Licence: arXiv.org - Non-exclusive license to distribute

Publications

References

Share and export

Consultation statistics

This page has been seen 708 times.
This article's PDF has been downloaded 224 times.