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
Parents
1.4K
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
Algebraic connectivity of graphs
Miroslav Fiedler · Czechoslovak Mathematical Journal · 1973 · 4K citations · Full text
Routing in a delay tolerant network
Sushant Jain, Kevin Fall, Rabin Patra · 2004 · 1.8K citations · Full text
THE LAPLACIAN SPECTRUM OF GRAPHS y
Bojan Mohar · 1991 · 1.1K citations
1–5 of 1.4K
2.5K
15
h-index
15
h-index
13
h-index
12
h-index
11
h-index
1–5 of 2.5K
985
Georgia Institute of Technology
Atlanta, United States
18 h-index
36 publications
2.2K citations

Nankai University
Tianjin, China
17 h-index
57 publications
1.6K citations
Beijing Jiaotong University
Beijing, China
17 h-index
46 publications
1.1K citations
Universitat Politècnica de Catalunya
Barcelona, Spain
17 h-index
75 publications
3K citations
Xinjiang University
Ürümqi, China
17 h-index
49 publications
1.4K citations
Carnegie Mellon University
Pittsburgh, United States
16 h-index
48 publications
4.6K citations

University of Waterloo
Waterloo, Canada
15 h-index
23 publications
1.6K citations

Tel Aviv University
Tel Aviv, Israel
15 h-index
28 publications
2.2K citations
1–8 of 985
103 publications · 3.8K citations
32
h-index
72 publications · 2.3K citations
27
h-index
55 publications · 2K citations
24
h-index
50 publications · 1.8K citations
24
h-index
39 publications · 1.6K citations
22
h-index
1–5