Matching Energy of Unicyclic and Bicyclic Graphs with a Given Diameter

Authors Lin Chen, Jin-Feng Liu, Yongtang Shi

Publication date 6 September 2014

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

m u_{1}, m u_{2}, l d o t s, m u_{n}

be the roots of its matching polynomial. The matching energy of

G

is defined to be the sum of the absolute values of

m u_{i} (i = 1, 2, l d o t s, n)

. In this paper, we characterize the graphs with minimal matching energy among all unicyclic and bicyclic graphs with a given diameter

d

.

This page was built for publication: Matching Energy of Unicyclic and Bicyclic Graphs with a Given Diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6254451)