Link Residual Closeness of Harary Graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917388063080448 |
|---|---|
| author | Dangalchev, Ch. |
| author_facet | Dangalchev, Ch. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_16882 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Link Residual Closeness of Harary Graphs Dangalchev, Ch. Discrete Mathematics 90C35 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. |
| title | Link Residual Closeness of Harary Graphs |
| topic | Discrete Mathematics 90C35 |
| url | https://arxiv.org/abs/2305.16882 |