2-Reconstructibility of Weakly Distance-Regular Graphs
Abstract
A graph is -reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting vertices. We prove that strongly regular graphs with at least six vertices are 2-reconstructible.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.