Edge-Diameter is a graph-theoretic metric that quantifies the maximum shortest path length between any two vertices in a network, where path length is measured exclusively by the number of edges traversed.
47
Publications
1.6K
Citations
97
Authors
62
Institutions
Publications per year
2017–2026
10
Parents
Publications
47
Connectivity of Regular Directed Graphs with Small Diameters
Imase, Soneoka, Okada · IEEE Transactions on Computers · 1985 · 126 citations
Diameter increase caused by edge deletion
A.A. Schoone, Hans L. Bodlaender, Jan Van Leeuwen · Journal of Graph Theory · 1987 · 102 citations · Full text
On the pathwidth of chordal graphs
Jens Gustedt · Discrete Applied Mathematics · 1993 · 93 citations
1–5 of 47
Authors
97
- CS
3
h-index
- IM
3
h-index
- CH
3
h-index
- MF
3
h-index
- DB
2
h-index
1–5 of 97
Institutions
62
Universitat Politècnica de Catalunya
Barcelona, Spain
5 h-index
19 publications
1.1K citations
University of Ljubljana
Ljubljana, Slovenia
4 h-index
5 publications
112 citations
Institute of Mathematics, Physics, and Mechanics
Ljubljana, Slovenia
3 h-index
4 publications
123 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
6 publications
72 citations
Hebei Normal University
Shijiazhuang, China
2 h-index
6 publications
164 citations
Umeå University
Umeå, Sweden
2 h-index
2 publications
70 citations
University of Split
Split, Croatia
2 h-index
2 publications
30 citations
Higher Education Centre Novo Mesto
Novo Mesto, Slovenia
2 h-index
3 publications
41 citations
1–8 of 62
Venues
- Discrete Mathematics
7 publications · 133 citations
7
h-index
- Discrete Applied Mathematics
5 publications · 194 citations
5
h-index
- Electronic Notes in Discrete Mathematics
3 publications · 72 citations
3
h-index
- Journal of Graph Theory
3 publications · 185 citations
3
h-index
- Graphs and Combinatorics
3 publications · 62 citations
3
h-index
1–5