Matching energy of unicyclic and bicyclic graphs with a given diameter |
| |
| Authors: | Lin Chen Jinfeng Liu Yongtang Shi |
| |
| Institution: | Center for Combinatorics and LPMC‐TJKLC, Nankai University, Tianjin, People's Republic of China |
| |
| Abstract: | 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  be the roots of its matching polynomial. The ME of G is defined to be the sum of the absolute values of  . In this article, we characterize the graphs with minimal ME among all unicyclic and bicyclic graphs with a given diameter d. © 2014 Wiley Periodicals, Inc. Complexity 21: 224–238, 2015 |
| |
| Keywords: | graph matching energy energy diameter |
|
|
