[1]吴倩倩,李红海.给定直径的单圈图的极小匹配能量[J].江西师范大学学报(自然科学版),2015,(06):584-587.
　WU Qianqian,LI Honghai.The Minimal Matching Energy of Unicyclic Graphs of a Given Diameter[J].Journal of Jiangxi Normal University:Natural Science Edition,2015,(06):584-587.
点击复制

给定直径的单圈图的极小匹配能量()
分享到：

《江西师范大学学报》（自然科学版）[ISSN:1006-6977/CN:61-1281/TN]

卷:
期数:
2015年06期
页码:
584-587
栏目:
出版日期:
2015-12-31

文章信息/Info

Title:
The Minimal Matching Energy of Unicyclic Graphs of a Given Diameter
作者:
吴倩倩;李红海
江西师范大学数学与信息科学学院,江西 南昌 330022
Author(s):
WU Qianqian; LI Honghai
College of Mathematics and Informatics,Jiangxi Normal University,Nanchang Jiangxi 330022,China
关键词:
匹配能量;  单圈图;  直径
Keywords:
matching energy;  unicyclic graph;  diameter
分类号:
O 157.5
文献标志码:
A
摘要:
图的匹配能量定义为该图的匹配多项式的零点的绝对值之和.设U(n,d)为n阶且直径为d的连通单圈图的集合,刻画了U(n,d)中取到极小匹配能量的极图.
Abstract:
The matching energy of a graph was defined as the sum of the absolute values of zeros of its matching polynomial.Let U(n,d) be the set of connected unicyclic graphs of order n and diameter d,the graph from U(n,d) minimizing the matching energy is completely characterized.

参考文献/References:

[1] Gutman I,Wagner S.The matching energy of a graph [J].Discrete Appl Match,2012,160(15):2177-2187.
[2] Li Shuli,Yan Weigen.The matching energy of graphs with given parameters [J].Discrete Appl Math,2014,162(1):415-420.
[3] Ji Shengjin,Li Xueliang,Shi Yongtang.Extremal matching energy of bicyclic graphs [J].MATCH Commun Math Comput Chem,2013,70(2):697-706.
[4] Ji Shengjin,Ma Hongping.The extremal matching energy of graphs [J].Ars Combinatoria,2014,115:343-355.
[5] Chen Lin,Shi Yongtang.Maximal matching energy of tricyclic graphs [J].MATCH Commun Math Comput Chem,2015,73(1):105-119.
[6] Li Honghai,Zhou Yunxia,Su Li.Graphs with extremal matching energies and prescribed parameters [J].MATCH Commun Math Comput Chem,2014,72(1):239-248.
[7] Chen Lin,Liu Jinfeng,Shi Yongtang.Matching energy of unicyclic and bicyclic graphs with a given diameter [J].Complexity,2014,20(2):1-28.
[8] Li Feng,Zhou Bo.Minimal energy of unicyclic graphs of a given diameter [J].J Math Chem,2008,43(2):476-484.
[9] Gutman I,Cvetkovic D.Finding tricyclic graphs with a maximal number of matchings-another example of computer aided research in graph theory [J].Publications de l'Institut Mathématique,Nouvelle Série,1984,35(1):33-40.
[10] Li Xueliang,Shi Yongtang,Gutman I.Graph energy [M].New York:Springer,2012.
[11] Gutman I,Zhang Fuji.On the ordering of graphs with respect to their matching numbers [J].Discrete Appl Math,1986,15(1):25-33.

备注/Memo

备注/Memo:
基金项目:国家自然科学基金(11201198),江西省自然科学基金(20132BAB201013,20142BAB211013)和江西师范大学青年英才基金资助项目.
更新日期/Last Update: 1900-01-01