Graph Centrality Analysis

Graph Centrality Analysis is a methodological framework within graph analytics that identifies and quantifies the relative importance or influence of nodes in a network based on their structural position, distinguished by its focus on measuring centrality through metrics such as degree, betweenness, closeness, and eigenvector centrality.

515

Publications

51.5K

Citations

1.4K

Authors

664

Institutions

Publications per year

2017–2026

238

Authors

1.4K

  1. DJ
    Desmond J. Higham

    University of Strathclyde, United Kingdom

    8 publications · 515 citations

    8

    h-index

  2. DA
    David A. Bader

    Georgia Institute of Technology, United States

    8 publications · 605 citations

    8

    h-index

  3. ÉS
    Érik Saule

    The Ohio State University, United States

    7 publications · 258 citations

    7

    h-index

  4. RC
    Regino Criado

    Universidad Rey Juan Carlos, Spain

    6 publications · 546 citations

    6

    h-index

  5. AE
    Ahmet Erdem Sarıyüce

    The Ohio State University, United States

    6 publications · 242 citations

    6

    h-index

1–5 of 1.4K

Venues

  1. 15

    h-index

  2. arXiv (Cornell University)

    Repository · 16 publications · 378 citations

    13

    h-index

  3. IEEE Access

    10 publications · 398 citations

    10

    h-index

  4. Social Networks

    9 publications · 3.2K citations

    9

    h-index

  5. PLoS ONE

    9 publications · 549 citations

    9

    h-index

1–5