Graph-theoretic Connectivity Analysis
Graph-Theoretic Connectivity Analysis is a graph-theoretic method that models spatial connectivity as a network of nodes and edges to analyze least-cost paths by evaluating topological relationships and flow efficiency within a structured graph representation.
102
Publications
5.7K
Citations
291
Authors
174
Institutions
Publications per year
2017–2026
22
Parents
102
Circulants and their connectivities
F Boesch, Ralph Tindell · Journal of Graph Theory · 1984 · 351 citations
Rainbow Connections of Graphs: A Survey
Xueliang Li, Yongtang Shi, Yuefang Sun · Graphs and Combinatorics · 2012 · 262 citations
1–5 of 102
291
3
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 291
174

University of Regina
Regina, Canada
3 h-index
5 publications
267 citations
Beijing Jiaotong University
Beijing, China
3 h-index
7 publications
214 citations

Nankai University
Tianjin, China
3 h-index
5 publications
880 citations
Hebrew University of Jerusalem
Jerusalem, Israel
3 h-index
5 publications
275 citations
Xinjiang University
Ürümqi, China
3 h-index
6 publications
88 citations

Eötvös Loránd University
Budapest, Hungary
2 h-index
2 publications
64 citations
University of the Andes
Merida, Venezuela
2 h-index
4 publications
153 citations

UNSW Sydney
Sydney, Australia
2 h-index
3 publications
132 citations
1–8 of 174
5 publications · 286 citations
5
h-index
5 publications · 100 citations
5
h-index
3 publications · 407 citations
3
h-index
3 publications · 99 citations
3
h-index
2 publications · 122 citations
2
h-index
1–5