冠图P_3·C_m的两种度结合边重构数  

Two Kinds of Degree-associated Edge Reconstruction Numbers of P_3·C_m

作　　者：黄陈辰 石黄萍 

机构地区：[1]浙江师范大学数理与信息工程学院,浙江金华321004

出　　处：《韶关学院学报》2015年第6期5-7,共3页Journal of Shaoguan University

基　　金：国家自然科学基金项目(11101378)

摘　　要：边重构猜想是指至少含有边的图能被它的边主子图集所决定,通过分析冠图的一个边主子图可能重构的图的结构,确定了它的两种边度结合重构数,进一步丰富了结构图论的内容.Edge-reconstruction conjecture states that every graph with more than three edges is determined by its edge-card. Two kinds of degree associated edge reconstruction numbers of the graph P3·Cm are determined by considering the possible reconstructions from a degree-associate edge-card. The results enrich the structure property of graphs.

关 键 词：冠图 重构 边主子图 度结合边重构数 

分 类 号：O157.5[理学—数学]