Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (2): 61-62.DOI: 10.3778/j.issn.1002-8331.2009.02.016

• 研究、探讨 • Previous Articles     Next Articles

Number of matching equivalent to union graph of points and cycles

WANG Xiao-ling,MA Hai-cheng   

  1. Department of Mathematics,Qinghai Nationalities College,Xining 810007,China
  • Received:2008-09-04 Revised:2008-10-30 Online:2009-01-11 Published:2009-01-11
  • Contact: WANG Xiao-ling

点圈并图的匹配等价图数

汪小玲,马海成   

  1. 青海民族学院 数学系,西宁 810007
  • 通讯作者: 汪小玲

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 equivalent.We denote by δG) the number of the matching equivalent graphs of G.In[5],authors have given δsK1t1Cm1t2Cm2) when{m1m2}∩{6,9,15}=Φ.In this paper,δsK1t1C3t2C6) and δsK1t1C6t2C9) is given,which is a generation of the results of in[5].

Key words: graph, matching polynomial, matching equivalence

摘要: 若两个图GH的匹配多项式相等,称图GH匹配等价用δG)表示图G的所有不同构的匹配等价图的个数。文[5]在{m1m2}∩{6,9,15}=Φ准的条件下计算了δsK1t1Cm1t2Cm2),在该文中计算了δsK1t1C3t2C6)、δsK1t1C6t2C9)是文[5]的完善和补充。

关键词: 图, 匹配多项式, 匹配等价