CLOSENESS CENTRALITY IN GRAPH PRODUCTS

被引:2
|
作者
Eballe, Rolito G. [1 ]
Balingit, Cherry Mae R. [1 ]
Cabahug Jr, Isagani S. [1 ]
Flores, Ann Leslie V. [1 ]
Lumpayao, Shiena Mae B. [1 ]
Penalosa, Braullo D. [1 ]
Tampipi, Glee Ann L. [1 ]
Villarta, Cerina A. [1 ]
机构
[1] Cent Mindanao Univ, Dept Math, Coll Arts & Sci, Maramag 8714, Bukidnon, Philippines
来源
关键词
centrality; closeness centrality; graph products;
D O I
10.17654/0974165823034
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Closeness centrality is one of the three most widely known measures of centrality used in the analysis of social networks. It describes the relative importance of a particular vertex within a network or a graph by taking the average closeness of this vertex from all the others in that graph. In this paper, we present the closeness centrality of the vertices in four products of two graphs G and H such as their complete product G proves H, corona product G o H, Cartesian product G H, and lexicographic product G[H].
引用
收藏
页码:29 / 41
页数:13
相关论文
共 50 条
  • [41] Mint Centrality: A Centrality Measure for the Bitcoin Transaction Graph
    Pontiveros, Beltran Borja Fiz
    Steichen, Mathis
    State, Radu
    2019 IEEE INTERNATIONAL CONFERENCE ON BLOCKCHAIN AND CRYPTOCURRENCY (ICBC), 2019, : 159 - 162
  • [42] Efficient Closeness Centrality Computation in Time-Evolving Graphs
    Ni, Peng
    Hanai, Masatoshi
    Tan, Wen Jun
    Cai, Wentong
    PROCEEDINGS OF THE 2019 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2019), 2019, : 378 - 385
  • [43] Robustness and closeness centrality for self-organized and planned cities
    Masucci, A. Paolo
    Molinero, Carlos
    EUROPEAN PHYSICAL JOURNAL B, 2016, 89 (02): : 1 - 8
  • [44] DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks
    Wehmuth, Klaus
    Ziviani, Artur
    COMPUTER NETWORKS, 2013, 57 (13) : 2536 - 2548
  • [45] Enabling fast path delay measurement using closeness centrality
    Yan, Binghao
    Liu, Qinrang
    Shen, Jianliang
    Dong, Liang
    INTERNET TECHNOLOGY LETTERS, 2022, 5 (04)
  • [46] Efficient parallel algorithms for dynamic closeness- and betweenness centrality
    Regunta, Sai Charan
    Tondomker, Sai Harsh
    Shukla, Kshitij
    Kothapalli, Kishore
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2023, 35 (17):
  • [47] Robustness and closeness centrality for self-organized and planned cities
    A. Paolo Masucci
    Carlos Molinero
    The European Physical Journal B, 2016, 89
  • [48] Network Invulnerability Enhancement Algorithm Based on WSN Closeness Centrality
    Sun, Qian
    Yang, Fengbo
    Wang, Xiaoyi
    Li, Jing
    Xu, Jiping
    Zhang, Huiyan
    Wang, Li
    Yu, Jiabin
    Peng, Xiao
    Wang, Ruichao
    CMC-COMPUTERS MATERIALS & CONTINUA, 2022, 73 (02): : 3021 - 3038
  • [49] A penalty box approach for approximation betweenness and closeness centrality algorithms
    Khopkar, Sushant S.
    Nagi, Rakesh
    Tauer, Gregory
    SOCIAL NETWORK ANALYSIS AND MINING, 2016, 6 (01) : 1 - 13
  • [50] Ranking of closeness centrality for large-scale social networks
    Okamoto, Kazuya
    Chen, Wei
    Li, Xiang-Yang
    FRONTIERS IN ALGORITHMICS, 2008, 5059 : 186 - +