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

Authors

465

  1. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    14 publications · 2.9K citations

    13

    h-index

  2. NA
    Noga Alon

    Tel Aviv University, Israel

    12 publications · 759 citations

    12

    h-index

  3. SV
    Salil Vadhan

    Harvard University Press, United States

    9 publications · 1.1K citations

    9

    h-index

  4. MK
    Michael Krivelevich

    Tel Aviv University, Israel

    9 publications · 215 citations

    9

    h-index

  5. EU
    Eli Upfal

    Brown University, United States

    8 publications · 355 citations

    8

    h-index

1–5 of 465

Venues

  1. SIAM Journal on Computing

    14 publications · 524 citations

    13

    h-index

  2. arXiv (Cornell University)

    Repository · 17 publications · 427 citations

    12

    h-index

  3. IEEE Transactions on Information Theory

    11 publications · 1.6K citations

    11

    h-index

  4. Random Structures and Algorithms

    10 publications · 581 citations

    10

    h-index

  5. Journal of the ACM

    JACM · 8 publications · 1.4K citations

    8

    h-index

1–5