J4 ›› 2013, Vol. 48 ›› Issue (2): 49-52.
• 高端论坛 • 上一篇 下一篇
邹锦玉,任海珍
收稿日期:
出版日期:
发布日期:
作者简介:
基金资助:
国家自然科学基金资助项目(11061027, 11161037); 青海省自然科学基金资助项目(2011Z907)
ZOU Jin-yu, REN Hai-zhen
Received:
Online:
Published:
摘要：
设Kp是p阶完全图。 取Kp的任意r个顶点分别点粘接r颗树,所得到的n阶图集记为L*n,p。 确定了L*n,p中具有最大和最小,第二大和第三大全匹配数的图。
关键词: 全匹配数; 图变换; 极值图
Abstract:
Let Kp be a complete graph of order p. Let L*n,p be the graph with n vertices obtained by identifying the vertex ui of Kp with the vertex vi of the tree Ti, where i=1,2,…,r,1≤r≤p. The graphs of L*n,p with maximal and minimal, with secondlargest and thirdlargest total number of matchings are obtained respectively.
Key words: The total number of matchings; graph transformation; extremal graph
邹锦玉,任海珍. L*n,p图的全匹配数[J]. J4, 2013, 48(2): 49-52.
ZOU Jin-yu, REN Hai-zhen. The total number of matchings of L*n,p[J]. J4, 2013, 48(2): 49-52.
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: http://lxbwk.njournal.sdu.edu.cn/CN/
http://lxbwk.njournal.sdu.edu.cn/CN/Y2013/V48/I2/49
Cited
