Link Residual Closeness of Harary Graphs

• Autorzy: Dangalchev, Chavdar
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

closeness; residual closeness; Harary graphs

• Czasopismo: Fundamenta Informaticae
• Rocznik: 2024
• Tom: Vol. 191, nr 1
• Strony: 1--15
• Opis fizyczny: Bibliogr. 25 poz.

Twórcy

autor

Dangalchev, Chavdar

• Bulgarian Academy of Sciences Institute of Mathematics and Informatics, Bulgaria,

Bibliografia

• [1] Dangalchev Ch. Residual closeness in networks. Phisica A. 2006, 365(2):556-564. doi:10.1016/j.physa.2005.12.020.
• [2] Harary F. The maximum connectivity of a graph. In National Academy of Sciences of the United States of America. 1962, 48:1142-1146.
• [3] West DB. Introduction to Graph Theory, Englewood Cliffs, NJ:Prentice-Hall. 2000.
• [4] Golpek HT. Aytac A. Closeness and residual closeness of Harary graphs. 2023. arXiv:2308.11056 arXiv preprint.
• [5] Aytac A, Odabas ZN. Residual closeness of wheels and related networks. IJFCS. 2011, 22(5):1229-1240. doi:10.1142/S0129054111008660.
• [6] Dangalchev Ch. Residual closeness and generalized closeness. IJFCS. 2011, 22(8):1939-1947. doi:10.1142/S0129054111009136.
• [7] Odabas ZN, Aytac A. Residual closeness in cycles and related networks. Fundamenta Informaticae. 2013, 124 (3): 297-307. doi:10.3233/FI-2013-835.
• [8] Turaci T, Okten M. Vulnerability of Mycielski graphs via residual closeness, Ars Combinatoria. 2015.118: 419-427.
• [9] Aytac A, Berberler ZNO. Robustness of Regular Caterpillars. IJFCS. 2017, 28(7): 835-841. doi:10.1142/S0129054117500277.
• [10] Aytac A, Odabas ZN. Network robustness and residual closeness. RAIRO-Operations Research. 2017,52(3), 839-847. doi:10.1051/ro/2016071.
• [11] Turaci T, Aytac V. Residual Closeness of Splitting Graphs. Ars Combinatoria. 2017, 130:17-27.
• [12] Dangalchev Ch. Residual Closeness of Generalized Thorn Graphs. Fundamenta Informaticae. 2018, 162(1):1-15. doi:10.3233/FI-2018-1710.
• [13] Aytac V, Turaci T. Closeness centrality in some splitting networks. Computer Science Journal of Moldova. 2018, 26(3):251-269. doi:10.56415.
• [14] Rupnik D, ˇZerovnik J. Networks with Extremal Closeness. Fundamenta Informaticae. 2019, 167(3):219-234. doi:10.3233/FI-2019-1815.
• [15] Yigit E, Berberler ZN. A Note on the Link Residual Closeness of Graphs Under Join Operation. IJFCS. 2019, 30(03):417-424. doi:10.1142/S0129054119500126.
• [16] Dangalchev Ch. Closeness of Splitting Graphs. C.R. Acad. Bulg. Sci. 2020, 73(4): 461-466.
• [17] Dangalchev Ch. Additional Closeness and Networks Growth. Fundamenta Informaticae. 2020, 176(1):1-15. doi:10.3233/FI-2020-1960.
• [18] Zhou B, Li Z, Guo H. Extremal results on vertex and link residual closeness. IJFCS. 2021, 32(08):921-941. doi:10.1142/S0129054121500295.
• [19] Dangalchev Ch. Additional Closeness of Cycle Graphs. IJFCS. 2022, 33(08):1033-1052. doi:10.1142/S0129054122500149.
• [20] Golpek HT. Vulnerability of Banana trees via closeness and residual closeness parameters. Maltepe Journal of Mathematics, 2022, 4(2):1-5. doi:10.47087/mjm.1156370.
• [21] Zheng L, Zhou B. On the spectral closeness and residual spectral closeness of graphs. RAIRO-Operations Research. 2022, 56(4):2651-68. doi:10.1051/ro/2022125.
• [22] Cheng MQ, Zhou B. Residual closeness of graphs with given parameters. Journal of Operations Research Society of China. 2022, 11(5):18:1-8. doi:10.1007/s40305-022-00405-9.
• [23] Dangalchev Ch. Algorithms for Closeness, Additional Closeness and Residual Closeness, Computer Vision Studies. 2023, 2(1):1-7. doi:10.58396/cvs020102.
• [24] Wang Y, Zhou B. Residual closeness, matching number and chromatic number. The Computer Journal, 2023, 66(5):1156-1166. doi:10.1093/comjnl/bxac004.
• [25] Dangalchev Ch. Closeness Centralities of Lollipop Graphs, The Computer Journal, (to appear), doi:10.1093/comjnl/bxad120.

Identyfikatory

DOI

10.3233/FI-242170