$2$-Reconstructibility of Weakly Distance-Regular Graphs

A graph is $\mathrm{\ell }$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\mathrm{\ell }$ vertices. We prove that strongly regular graphs with at least six vertices are $2$-reconstructible.