Graph Connectivity

Graph Connectivity is a structural metric in network topology that quantifies the minimum number of nodes or edges whose removal disconnects a graph, distinguishing it as a measure of robustness and navigability within graph-theoretic systems.

1.4K

Publications

102K

Citations

2.5K

Authors

985

Institutions

Publications per year

2017–2026

297

Authors

2.5K

  1. RH
    Rong‐Xia Hao

    Beijing Jiaotong University, China

    19 publications · 461 citations

    15

    h-index

  2. XL
    Xueliang Li

    Nankai University, China

    25 publications · 734 citations

    15

    h-index

  3. CB
    C. Balbuena

    Universitat Politècnica de Catalunya, Spain

    16 publications · 314 citations

    13

    h-index

  4. HL
    Hong‐Jian Lai

    West Virginia University, United States

    17 publications · 492 citations

    12

    h-index

  5. XM
    X. Marcote

    Universitat Politècnica de Catalunya, Spain

    11 publications · 209 citations

    11

    h-index

1–5 of 2.5K

Venues

  1. Discrete Mathematics

    103 publications · 3.8K citations

    32

    h-index

  2. Discrete Applied Mathematics

    72 publications · 2.3K citations

    27

    h-index

  3. Journal of Graph Theory

    55 publications · 2K citations

    24

    h-index

  4. Journal of Combinatorial Theory Series B

    50 publications · 1.8K citations

    24

    h-index

  5. Networks

    39 publications · 1.6K citations

    22

    h-index

1–5