Abstract
The matching energy of a graph is defined as the sum of the absolute values of the zeros of its matching polynomial. Let Gn,m be the set of connected graphs of order n and with m edges. In this note we determined the extremal graphs from Gn,m with n ≤ m ≤ 2n-4 minimizing the matching energy. Also we determined the minimal matching energy of graphs from Gn,m where m = n-1+t and 1 ≤ t ≤ β-1 and with a given matching number β. Moreover, the above extremal graphs have been completely characterized.
| Original language | English |
|---|---|
| Pages (from-to) | 93-104 |
| Number of pages | 12 |
| Journal | Match |
| Volume | 73 |
| Issue number | 1 |
| State | Published - 2015 |