节点文献
点圈并图的匹配等价图数
Number of matching equivalent to union graph of points and cycles
【摘要】 若两个图G和H的匹配多项式相等,称图G和H匹配等价用(δG)表示图G的所有不同构的匹配等价图的个数。文[5]在{m1,m2}∩{6,9,15}=Ф的条件下计算了δ(sK1∪t1Cm1∪t2Cm2),在该文中计算了δ(sK1∪t1C3∪t2C6)、δ(sK1∪t1C6∪t2C9)是文[5]的完善和补充。
【Abstract】 For two graphs G and H,if G and H has the same matching polynomial,then G and H is called to be matching equiv-alent.We denote by δ(G) the number of the matching equivalent graphs of G.In[5],authors have given δ(sK1∪t1Cm1∪t2Cm2) when {m1,m2}∩{6,9,15}=Ф.In this paper,δ(sK1∪t1C3∪t2C6) and δ(sK1∪t1C6∪t2C9) is given,which is a generation of the results of in[5].
【基金】 国家自然科学基金No.10861009~~
- 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2009年02期
- 【分类号】O157.5
- 【下载频次】68