Matching energy of unicyclic and bicyclic graphs with a given diameter

作者：Chen Lin; Liu Jinfeng; Shi Yongtang^*

来源：Complexity, 2015, 21(2): 224-238.

DOI：10.1002/cplx.21599

• graph
• matching energy
• energy
• diameter

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.

• 出版日期2015-12
• 单位南开大学