Closeness Centrality of Vertices in Graphs Under Some Operations

Abstract

In this paper, we revisit the concept of (normalized) closeness centrality of a vertex in a graph and investigate it in some graphs under some operations. Specifically, we derive formulas that compute the closeness centrality of vertices in the shadow graph, complementary prism, edge corona, and disjunction of graphs.