图的极大匹配能(英)

doi:10.3969/j.issn.1000-5641.2015.01.017

华东师范大学学报(自然科学版) ›› 2015, Vol. 2015 ›› Issue (1): 136-141.doi: 10.3969/j.issn.1000-5641.2015.01.017

图的极大匹配能(英)

吴廷增

青海民族大学数学与统计学院, 西宁 810007

收稿日期:2014-05-01 出版日期:2015-01-25 发布日期:2015-03-29
通讯作者: 吴廷增,男, 副教授, 研究方向为组合矩阵论、化学图论. E-mail:mathtzwu@163.com
基金资助:
青海民族大学重点学科建设项目和校级项目(2015XJZ03)

On the maximal matching energy of graphs

WU Ting-Zeng

School of Mathematics and Statistics, Qinghai Nationalities University, Xining 810007, China

Received:2014-05-01 Online:2015-01-25 Published:2015-03-29

摘要/Abstract

摘要： Gutman和Wagner (The matching energy of a graph, Discrete Appl. Math. 2012 (160): 2177-2187)首次提出了匹配能的定义, 即:图的匹配多项式的所有特征根的绝对值之和称为图的匹配能.他们证明了在n个顶点的图中, 完全图$K_{n}$有最大匹配能.本文完全刻画了具有第二大至第十六大匹配能的图

关键词: 匹配多项式, 匹配能, Hosoya指标

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 K_n 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.

Key words: matching polynomial, matching energy, Hosoya index

中图分类号:

O157.5

吴廷增. 图的极大匹配能(英)[J]. 华东师范大学学报(自然科学版), 2015, 2015(1): 136-141.

WU Ting-Zeng. On the maximal matching energy of graphs[J]. Journal of East China Normal University(Natural Sc, 2015, 2015(1): 136-141.

参考文献

GODSIL C D. Algebraic Combinatorics [M]. New York: Chapman and Hall, 1993.
GUTMAN I, WAGNER S. The matching energy of a graph [J]. Discrete Appl Math, 2012 (160): 2177--2187.
JI S J, LI X L, SHI Y T. Extremal matching energy of bicyclic graphs [J]. MATCH Commun Math Comput Chem, 2013 (70): 697--706.
LI S L, YAN W G. The matching energy of graphs with given parameters [J]. Discrete Appl Math, 2014 (162): 415--420.
ZHANG H P, WU T Z, LAI H J. Per-spectral characterizations of some edge-deleted subgraphs of a complete graph [J]. Linear and Multilinear Algebra, 2015 (63): 397-410.
LOVASZ L. Combinatorial Problems and Exercises [M]. Akadémiai Kiadó: Budapest, 1993. MOHAR B. Some applications of Laplace eigenvalues of graphs [M]//HAHN G, EDS G S. Graph Symmetry. Dordrecht: Kluwer Academic Press, 1997, 225-275.
CAO D S, HONG Y. The distribution of eigenvalues of graphs [J]. Linear Algebra and its Application, 1995 (216): 211-224.
SHEARER J B. On the distribution of the maximum eigenvalue of graphs [J]. Linear Algebra and its Application, 1984 (114/115): 17-20.
GUO J M. The limit points of Laplacian spectra of graphs [J]. Linear Algebra and its Application, 2003 (362): 121-128.
GUO J M. On limit points of Laplacian spectral radii of graphs [J]. Linear Algebra and its Application, 2008 (429): 1705-1718.
SHU J L. Bounds on Eigenvalues of Graphs (in Chinese) [D]. Shanghai: East China Normal University, 1999.
VO\'ASZ L, PELINK\'AN J. On the eigenvalues of tress [J]. Periodica Math Hung 1973 (3): 175-182.
DOOB M. The limit points of eigenvalues of graphs [J]. Linear Algebra and its Application, 1989 (114/115): 659-662.
GRONE R, MERRIS R, SUNDER V. The Laplacian spetrum of a graph [J]. SIAM J Matrix Anal Appl, 1990 (11): 218-238.
MERRIS R. Laplacian matrices of graphs:a surver [J]. Linear Algebra and its Application, 1994 (197/198): 143-176.
ZHANG X D. Graphs with fourth Laplacian eigenvalue less than two [J]. European Journal of Combinatorics, 2003 (24): 617-630.

[1]	马骅, 蒋雪中. 长江口潮周期内总悬浮颗粒物浓度的光学反演算法分析[J]. 华东师范大学学报(自然科学版), 2016, 2016(3): 146-155.
[2]	许洋. 非负特征图的列表不完全染色的研究(英)[J]. 华东师范大学学报(自然科学版), 2016, 2016(2): 51-55.
[3]	何常香, 刘伟龙. 2n阶(n-2)-正则二部图的最小基本圈基[J]. 华东师范大学学报(自然科学版), 2016, 2016(2): 56-61.
[4]	牛爱红, 王国平, 秦正新, 牟善志. 具有最大谱半径的二部图的刻画(英)[J]. 华东师范大学学报(自然科学版), 2016, 2016(1): 96-101.
[5]	黄小佳, 陈祥恩, 王治文. 当35 ≤ d ≤ 55时圈的d-强全染色[J]. 华东师范大学学报(自然科学版), 2015, 2015(6): 30-35.
[6]	杨胜彬, 伍平, 汪国明. 基于随机穷举算法最优化污水处理站建造方案[J]. 华东师范大学学报(自然科学版), 2015, 2015(3): 21-30.
[7]	齐林明, 苗连英, 李卫奇. 关于边染色临界图的独立数[J]. 华东师范大学学报(自然科学版), 2015, 2015(1): 114-119.
[8]	蔡改香, 余桂东, 邢抱花. 具有k个悬挂点的n阶单圈图的Harary指数(英)[J]. 华东师范大学学报(自然科学版), 2015, 2015(1): 120-125.
[9]	吴雅容. 关于图的第三大拉普拉斯特征值的极限点(英)[J]. 华东师范大学学报(自然科学版), 2015, 2015(1): 126-130.
[10]	吕长青. 上可嵌入图与次上可嵌入图的线性荫度[J]. 华东师范大学学报(自然科学版), 2015, 2015(1): 131-135.
[11]	余君, 温利民. 方差相关原理下相依聚合风险模型的贝叶斯保费[J]. 华东师范大学学报(自然科学版), 2014, 2014(4): 26-38.
[12]	李丹, 王国平. 给定权集的赋权双圈图的谱半径[J]. 华东师范大学学报(自然科学版), 2014, 2014(4): 39-42.
[13]	任韩, 晁福刚. Thomassen与曲面嵌入图的着色[J]. 华东师范大学学报(自然科学版), 2014, 2014(3): 1-7, 39.
[14]	张晓建, 杨甲山. 时标上三阶时滞动力方程的振动性和渐近性[J]. 华东师范大学学报(自然科学版), 2014, 2014(3): 51-59.
[15]	段芳, 张维娟. 不含 2K₁+K₂ 和 C₄ 作为导出子图的图的色数[J]. 华东师范大学学报(自然科学版), 2014, 2014(1): 9-12.

图的极大匹配能(英)

On the maximal matching energy of graphs

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价