|
|||||
|
|
| 图的极大匹配能(英文) | |
| 引用本文： | 吴廷增. 图的极大匹配能(英文)[J]. 华东师范大学学报(自然科学版), 2015, 2015(1): 136-141 |
| 作者姓名： | 吴廷增 |
| 作者单位： | 青海民族大学 数学与统计学院, 西宁 810007 |
| 基金项目： | 青海民族大学重点学科建设项目和校级项目 |
| 摘 要： | Gutman和Wagner(The matching energy of a graph,Discrete Appl.Math.2012(160):2177-2187)首次提出了匹配能的定义,即:图的匹配多项式的所有特征根的绝对值之和称为图的匹配能.他们证明了在n个顶点的图中,完全图Kn有最大匹配能.本文完全刻画了具有第二大至第十六大匹配能的图. |
| 关 键 词： | 匹配多项式 匹配能 Hosoya指标 |
| 收稿时间： | 2014-05-01 |
On the maximal matching energy of graphs |
|
| WU Ting-zeng. On the maximal matching energy of graphs[J]. Journal of East China Normal University(Natural Science), 2015, 2015(1): 136-141 | |
| Authors: | WU Ting-zeng |
| Affiliation: | School of Mathematics and Statistics, Qinghai Nationalities University, Xining 810007, China |
| Abstract: | The matching energy is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph, which was firstly proposed by Gutman and Wagner (The matching energy of a graph, Discrete Appl. Math. 2012 (160): 2177õ2187). And they showed that the complete graph Kn had maximum matching energy in all graphs on n vertices. In this paper, among all graphs on n vertices, the graphs with i-th maximal matching energy are completely characterized, where i = 2, 3, . . . , 16. |
| Keywords: | matching polynomial matching energy Hosoya index |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
| 点击此处可从《华东师范大学学报(自然科学版)》浏览原始摘要信息 | |
| 点击此处可从《华东师范大学学报(自然科学版)》下载全文 | |