Expander Graphs
Expander Graphs is a mathematical construct in graph theory characterized by sparse connectivity yet strong expansion properties, where every small subset of vertices has a large neighborhood, ensuring efficient information dissemination and robustness against node failures.
317
Publications
20.8K
Citations
465
Authors
222
Institutions
Publications per year
2017–2026
46
Parents
317
Expander graphs and their applications
Shlomo Hoory, Nathan Linial, Avi Wigderson · Bulletin of the American Mathematical Society · 2006 · 1.8K citations · Full text
M. Sipser, Daniel A. Spielman · IEEE Transactions on Information Theory · 1996 · 942 citations
Alasdair Urquhart · Journal of the ACM · 1987 · 451 citations · Full text
1–5 of 317
465
13
h-index
12
h-index
9
h-index
9
h-index
8
h-index
1–5 of 465
222

Tel Aviv University
Tel Aviv, Israel
18 h-index
42 publications
2.2K citations
Hebrew University of Jerusalem
Jerusalem, Israel
17 h-index
37 publications
3.9K citations
Princeton University
Princeton, United States
15 h-index
26 publications
2K citations
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
18 publications
2K citations
University of California, Berkeley
Berkeley, United States
14 h-index
25 publications
2.9K citations

Weizmann Institute of Science
Rehovot, Israel
13 h-index
18 publications
1.4K citations

Harvard University Press
Cambridge, United States
12 h-index
14 publications
968 citations

Institute for Advanced Study
Princeton, United States
12 h-index
18 publications
3K citations
1–8 of 222
14 publications · 524 citations
13
h-index
Repository · 17 publications · 427 citations
12
h-index
11 publications · 1.6K citations
11
h-index
10 publications · 581 citations
10
h-index
JACM · 8 publications · 1.4K citations
8
h-index
1–5