图的匹配能量由GUTMAN等于2012年提出,定义为图的匹配多项式的根的绝对值的和.如果一个连通图的边数与点数相等,或有唯一的一个圈,则称为单圈图.刻画了在具有给定阶与最大度的所有单圈图中达到最大匹配能量的图.
The matching energy of a graph was introduced by GUTMAN et al in 2012 and defined as the sum of the absolute values of zeros of its matching polynomial. A connected graph is said to be unicyclic if it has as many verti- ces as the edges or equivalently, and has a unique cycle. The graphs with the maximum matching energy among all unicyclic graphs with the given order and maximum degree are characterized.