冠图PnoCm的两种度结合重构数

Two Kinds of Degree Associated Reconstruction Numbers of the Corona Graph Pno Cm

在20世纪中叶,Ulam和Kelly提出图的重构猜想,它是指任何一个至少含有3个顶点的图能够被它的主子图集所唯一确定,通过结合度参数,对冠图PnoCm的一个主子图所有可能重构的图的结构进行分析,从而确定了它的度结合重构数和一致度结合重构数,进一步丰富了结构图论的内容。

The reconstruction conjecture of Ulam and Kelly has been open for more than 50 years,it states that every graph on at least three veritics is determined by its“deck”of vertex-deleted subgraphs.By using the degree parameter,this paper discuss two kinds of degree associated reconstruction numbers of the corona graph P n o C m by considering the possible reconstructions from a degree-associate card.The results enrich the structure property of graphs.