COMPUTER SCIENCE JOURNAL OF MOLDOVA, cilt.26, no.78, ss.251-269, 2018 (ESCI İndekslerine Giren Dergi)
A central issue in the analysis of complex networks is the assessment of their robustness and vulnerability. A variety of measures have been proposed in the literature to quantify the robustness of networks, and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Centrality parameters play an important role in the field of network analysis. Numerous studies have proposed and analyzed several centrality measures. We consider closeness centrality which is defined as the total graph-theoretic distance to all other vertices in the graph. In this paper, closeness centrality of some splitting graphs is calculated, and exact values are obtained.