$2$-Reconstructibility of Weakly Distance-Regular Graphs
arxiv(2022)
摘要
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.
更多查看译文
关键词
graphs,distance-regular
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要