加载中…
2023-05-26
Link Residual Closeness of Harary Graphs
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本