自补图弱重构的穷举验证
Exhaustive Verification of Weak Reconstruction For Self Complementary Graphs
摘要：
本文给出了一个最多17个顶点的自补图的弱可重构性的穷举验证方法。它描述了重建猜想的一般问题，解释了检查两个图之间的甲板同构所涉及的复杂性。为了提高计算时间，采用了各种修剪技术来减少图同构比较的数量。这些技术在进行重建方法时提供了很大的帮助。对所涉数字进行了分析，并指出了这种做法的各种局限性。一个列表列举了SC图的数量，直到101顶点也被附加。
英文摘要：
This paper presents an exhaustive approach for verification of the weak reconstruction of Self Complementary Graphs up to 17 vertices. It describes the general problem of the Reconstruction Conjecture, explaining the complexity involved in checking deck-isomorphism between two graphs. In order to improve the computation time, various pruning techniques have been employed to reduce the number of graph-isomorphism comparisons. These techniques offer great help in proceeding with a reconstructive approach. An analysis of the numbers involved is provided, along with the various limitations of this approach. A list enumerating the number of SC graphs up till 101 vertices is also appended.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
