Closeness centrality in some splitting networks

Computer Science Journal of Moldova

卷:26

Vecdi Aytac¹  Tufan Turaci² 

[1] Ege University, Engineering Faculty, Computer Engineering Dept., Bornova-IZMIR-TURKEY;

[2] Karab\"uk University, Science Faculty, Mathematics Dept., Karabuk-TURKEY;

关键词: Graph theory;    network design and communication;    complex networks;    closeness centrality;    splitting graphs;   

DOI  :  

来源: DOAJ

【 摘 要 】

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. \textit{Centrality} parameters play an important role in the field of network analysis. Numerous studies have proposed and analyzed several \textit{centrality} measures. We consider \textit{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.

【 授权许可】

Unknown