L*n,p图的全匹配数 |
| |
引用本文: | 邹锦玉,任海珍.L*n,p图的全匹配数[J].山东大学学报(理学版),2013,48(2):49-52. |
| |
作者姓名: | 邹锦玉 任海珍 |
| |
作者单位: | 青海师范大学数学系,青海西宁,810008 |
| |
基金项目: | 国家自然科学基金资助项目,青海省自然科学基金资助项目 |
| |
摘 要: | 设Kp是p阶完全图。 取Kp的任意r个顶点分别点粘接r颗树,所得到的n阶图集记为L*n,p。 确定了L*n,p中具有最大和最小,第二大和第三大全匹配数的图。
|
关 键 词: | 全匹配数 图变换 极值图 |
收稿时间: | 2011-11-08 |
The total number of matchings of L*n,p |
| |
Affiliation: | Department of Mathematics, Qinghai Normal University, Xining 810008, Qinghai, China |
| |
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 second largest and third largest total number of matchings are obtained respectively. |
| |
Keywords: | The total number of matchings graph transformation extremal graph |
本文献已被 万方数据 等数据库收录! |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
|
点击此处可从《山东大学学报(理学版)》下载全文 |
|