Extremal Results on Vertex and Link Residual Closeness

Robustness of the network topology is a key aspect in the design of computer networks. Vertex (Link, respectively) residual closeness is a new graph-theoretic concept defined as a measure of network robustness due to the failure of individual vertices (links, respectively). In this paper, we identify the trees and unicyclic graphs with the first a few smallest vertex residual closeness, and determine the graphs that minimize or maximize the vertex (link, respectively) residual closeness over some classes of graphs.