arXiv
Open Access
2023
Link Residual Closeness of Harary Graphs
Ch. Dangalchev
Abstrak
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.
Topik & Kata Kunci
Penulis (1)
C
Ch. Dangalchev
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2023
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓