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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have