双圈图的匹配能量.pdfVIP

摘 要 图的匹配能量是由Gutman, Wagner于2012年提出的概念，其定义为图的匹配 多项式的根的绝对值的和. 双圈图是边数等于点数加一的连通图.本文分两部 分来研宄双圈图匹配能量的极图 . 1)第一部分得到了给定阶的双圈图的最大匹配能量的极图 . 步骤如下：首 先 ，根据双圈图的结构，将其分成两类；其次，在每类中我们得到了具有最 大匹配能量的图形，也得到了一些更详细的结论；最后，我们比较以上两个 极图并且得到了给定阶的双圈图的最大匹配能量的极图 . 2)第二部分得到了给定阶和围长的双圈图的最小匹配能量的极图.我们采 用相似的方法得到结果 . 首先，将给定阶和围长的双圈图按照以上方法分成两 类; 然后得到每一类双圈图的最小匹配能量的极图，同时也得到了一些更精 确的结论，例 如将匹配能量 变 小的一些 变换 ; 最后，比较以上两个最小匹配 量的图形，我们得到了最小匹配 景 的极图. 总之 ，我们得到了双圈图比较匹配能量的偏序 并且找 到了极图 . 关 词 ：双圈图；匹配能量；围长. II Abstract The matching energy of a graph was introduced by Gutman and Wagner in 2012 and defined as the sum of the absolute values of zeros of its matching polynomial. A bicyclic graph is a connected graph in which the number of edges equals the number of vertices plus one. The thesis consists of two parts of work on characterizing extremal matching energy of bicyclic graphs. 1) The graphs with maximum matching energy among all bicyclic graphs with given order are characterized. The schedule is as follows. First we partition the set of bicyclic graphs with given order into two classes according to their structure. Then we find out the graphs with maximum matching energy in each class, where much more elaborate ordering on graphs in each class in terms of matching energy is presented. At last, we compare the two extremal graphs from the classes and come to the the graph attaining maximum matching energy. 2) The graph with minimum matching energy among all bicyclic graphs with given order and girth is characterized. We take similar route to our goal. The set of all bicyclic graphs with given order and girth is partitioned into the same two classes as before. Then the respective extremal graphs in each class is given, where some el