Matching energy of unicyclic and bicyclic graphs with a given diameter
Matching energy of unicyclic and bicyclic graphs with a given diameter
复制标题
给定直径的单环和双环图的能量匹配
DOI：
10.1002/cplx.21599
复制
发表时间：
2015-11-01
期刊：
影响因子：
2.3
通讯作者：
Shi, Yongtang
中科院分区：
文献类型：
--
作者：
Chen, Lin;Liu, Jinfeng;Shi, Yongtang
古特曼和瓦格纳提出了匹配能的概念，并指出匹配能的化学应用可以追溯到20世纪70年代。设G是n阶简单图，m u(1)，m u(2)，…，m u(N)是其匹配多项式的根。G的ME定义为Mu(I)(i=1，2，…，n)的绝对值之和。在本文中，我们刻画了给定直径d的所有单圈和双圈图中具有极小ME的图。(C)2014 Wiley期刊，Inc.
Gutman and Wagner proposed the concept of matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let G be a simple graph of order n and mu(1),mu(2),...,mu(n) be the roots of its matching polynomial. The ME of G is defined to be the sum of the absolute values of mu(i)(i=1,2,...,n). In this article, we characterize the graphs with minimal ME among all unicyclic and bicyclic graphs with a given diameter d. (c) 2014 Wiley Periodicals, Inc.