2-Reconstructibility of Weakly Distance-Regular Graphs

2022/10/21 by West, Douglas B., Zhu, Xuding
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2210.11742

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.

Related

• 3-Regular Graphs Are 2-Reconstructible
• A Simple Explanation for the Reconstruction of Graphs
• Trees with at least 6ℓ+11 vertices are ℓ-reconstructible
• Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
• The transformation of edge-regular and pseudo strongly regular graphs\n under graph operations