Graph Connectivity Analysis

Graph Connectivity Analysis is a graph-theoretic analytical method that assesses the structural coherence and reachability properties within a graph by identifying connected components, bridges, articulation points, and resilience to node or edge failures, thereby distinguishing itself from other graph analysis techniques through its focus on topological integrity and network robustness.

84

Publications

3.2K

Citations

198

Authors

131

Institutions

Publications per year

2017–2026

23

Authors

198

  1. RH
    Rong‐Xia Hao

    Beijing Jiaotong University, China

    6 publications · 144 citations

    6

    h-index

  2. JC
    Jou–Ming Chang

    National Taipei University of Business, Taiwan

    5 publications · 121 citations

    5

    h-index

  3. MG
    Mei-Mei Gu

    Beijing Jiaotong University, China

    5 publications · 121 citations

    5

    h-index

  4. SM
    Sunil Mathew

    National Institute of Technology Calicut, India

    3 publications · 70 citations

    3

    h-index

  5. HS
    Harishchandra S. Ramane

    Karnatak University, India

    2 publications · 76 citations

    2

    h-index

1–5 of 198

Venues

  1. International Journal of Foundations of Computer Science

    IJFCS · 4 publications · 80 citations

    4

    h-index

  2. Discrete Applied Mathematics

    4 publications · 201 citations

    4

    h-index

  3. Networks

    3 publications · 108 citations

    3

    h-index

  4. The Computer Journal

    3 publications · 71 citations

    3

    h-index

  5. Journal of Interconnection Networks

    JOIN · 2 publications · 55 citations

    2

    h-index

1–5