$2$-Reconstructibility of Weakly Distance-Regular Graphs

arXiv2210.11742MaRDI QIDQ6414633

Douglas B. West, Xuding Zhu

Publication date: 21 October 2022

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

This page was built for publication: $2$-Reconstructibility of Weakly Distance-Regular Graphs