同构于树的立方体的图的重构猜想
Reconstruction Conjecture for Graphs Isomorphic to Cube of a Tree
摘要:
证明了与树的立方体同构的图的重构猜想。证明利用了树从其周边顶点删除子图的可重构性。主要结果如下:(i)树的立方体的特征(ii)树的立方体的可识别性(iii)树作为图G的立方根的唯一性,除非G是完全图(iv)树的可重构性从它们的外围顶点删除子图。
英文摘要:
This paper proves the reconstruction conjecture for graphs which are isomorphic to the cube of a tree. The proof uses the reconstructibility of trees from their peripheral vertex deleted subgraphs. The main result follows from (i) characterization of the cube of a tree (ii) recognizability of the cube of a tree (iii) uniqueness of tree as a cube root of a graph G, except when G is a complete graph (iv) reconstructibility of trees from their peripheral vertex deleted subgraphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。