Ch. Dangalchev - Link Residual Closeness of Harary Graphs

fi:11385 - Fundamenta Informaticae, March 30, 2024, Volume 191, Issue 1
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.

    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

    Consultation statistics

    This page has been seen 15 times.
    This article's PDF has been downloaded 7 times.