(k,6)-fullerene图与超立方图的匹配强迫和反强迫问题

图的匹配强迫和反强迫数作为拓扑不变量对预测分子的稳定性有重要意义，在数学和理论化学上引起了极大兴趣。Fullerene图是化学图论的活跃领域，其稳定性的研究一直是一个重要的理论课题。本项目将研究(3,6)-fullerene图和(5,6)-fullerene图的最大强迫数的非平凡上界；探索强迫谱不连续的(4,6)-fullerene图类的刻画；同时研究(4,6)-fullerene图反强迫谱的连续性。另外，作为最有效的互联网络拓扑结构，超立方图的研究涉猎各个领域。继著名图论专家Alon对超立方图的最大强迫数的研究之后，超立方图的最大反强迫数也已得到解决。本项目的另一项工作是求超立方图的最小反强迫数，并研究其匹配反强迫谱。这些工作将促进Fullerene稳定性的研究，深化超立方图的匹配强迫和反强迫的理论，从而进一步地推动匹配理论的发展。

The matching forcing and anti-forcing numbers of graphs as topology invariants are important for predicting the stability of molecular, which arouse enormous interest in mathematics and theoretical chemistry. Fullerene graphs are active fields in chemical graph theory, and its stability is always a significant theoretical topic. In this project, we will study the non-trivial upper bounds of the maximum forcing numbers of (3,6)-fullerenes and (5,6)-fullerenes, and characterize (4,6)-fullerenes with the forcing spectrum discontinuous. Moreover, the continuity of the anti-forcing spectrum of (4,6)-fullerenes will also be considered. Hypercubes are the most effective topology of the Internet. Its research dabble in various fields. Following the characterization of the maximum forcing number of hypercubes by Alon, its maximum anti-forcing number is also obtained. This project will also study the minimum anti-forcing number and the anti-forcing spectrum of hypercubes. The implementation of this project can promote the research of the stability of the Fullerenes, strengthen theoretical work on matching forcing and anti-forcing of hypercubes, and promote the further development of the matching theory of graphs.