Additional Closeness of Cycle Graphs
Chavdar Dangalchev · International Journal of Foundations of Computer Science · 2022
The additional closeness is a very important characteristic of graphs. It measures the maximal closeness of a graph after adding a new link and it is an indication of the growth potential of graphs’ closeness. Most of the time calculating the additional closeness requires solving nontrivial optimization problems. In this article, the additional closenesses of cycles, gear, and some other graphs are calculated. Bounds for additional closeness of graphs are discussed.