Networks with Extremal Closeness

Closeness of Splitting Graphs

“…More information on closeness, residual closeness, and additional closeness can be found in [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24].…”

“…When n ≥ 5 the additional closeness is supplied by adding link (V m , V m+k ). We use formulae (14) or (15) to determine the values of k and then formula (10) to calculate the additional closeness of the lollipop graph L m,n . The case with two links, supplying the additional closeness, is impossible when n ≥ 5, because the value of k, given by formulae ( 14) or (15), is much bigger than 3 (3 is the maximal value in Section 10, giving C(C) > C(A)).…”

Residual Closeness of Generalized Thorn Graphs

“…Throughout this article we will use the term "residual closeness" instead of "link residual closeness". More information on closeness, residual closeness, and additional closeness can be found in [5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23].…”