Editing Expander graph (section)

{{short description|Sparse graph with strong connectivity}}

In [[graph theory]], an '''expander graph''' is a [[sparse graph]] that has strong [[connectivity (graph theory)|connectivity]] properties, quantified using [[vertex (graph theory)|vertex]], [[edge (graph theory)|edge]] or [[spectral graph theory|spectral]] expansion. Expander constructions have spawned research in pure and applied mathematics, with several applications to [[Computational complexity theory|complexity theory]], design of robust [[computer network]]s, and the theory of [[error-correcting code]]s.<ref name="Hoory 2006">{{harvtxt|Hoory|Linial|Wigderson|2006}}</ref>