首页 | 本学科首页   官方微博 | 高级检索  
     

点圈并图的匹配等价图数
引用本文:汪小玲,马海成.点圈并图的匹配等价图数[J].计算机工程与应用,2009,45(2):61-62.
作者姓名:汪小玲  马海成
作者单位:青海民族学院,数学系,西宁,810007
摘    要:若两个图G和H的匹配多项式相等,称图G和H匹配等价用(δG)表示图G的所有不同构的匹配等价图的个数。文5]在{m1,m2}∩{6,9,15}=Ф的条件下计算了δ(sK1∪t1Cm1∪t2Cm2),在该文中计算了δ(sK1∪t1C3∪t2C6)、δ(sK1∪t1C6∪t2C9)是文5]的完善和补充。

关 键 词:  匹配多项式  匹配等价
收稿时间:2008-9-4
修稿时间:2008-10-30  

Number of matching equivalent to union graph of points and cycles
WANG Xiao-ling,MA Hai-cheng.Number of matching equivalent to union graph of points and cycles[J].Computer Engineering and Applications,2009,45(2):61-62.
Authors:WANG Xiao-ling  MA Hai-cheng
Affiliation:WANG Xiao-ling,MA Hai-cheng Department of Mathematics,Qinghai Nationalities College,Xining 810007,China
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.In5],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 in5].
Keywords:graph  matching polynomial  matching equivalence
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号