2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs (Q6133663)

An \(n\)-vertex graph \(G\) is \(\ell\)-reconstructible if the multiset of the \(\binom{n}{\ell}\) graphs obtained by deleting \(\ell\) vertices uniquely determines \(G\). The reconstruction conjecture by \textit{S. M. Ulam} [A collection of mathematical problems. New York, NY: Interscience Publishers (1960; Zbl 0086.24101)] states that every graph is \(1\)-reconstructible, and is known to be true for regular graphs. The authors prove that certain classes of (sufficiently large) regular graphs are \(2\)-reconstructible. Their result covers strongly regular graphs, distance-regular graphs, and weakly distance-regular graphs.