English Expander graph Cited by user Citation bot on 30 Jan 2019 In combinatorics, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion as described below.