Number of Matchings of Low Order in (4,6)-Fullerene Graphs
MATCH Commun. Math. Comput. Chem., 77(3), 2017, pp. 707--724.
This work is joint with Prof. Heping Zhang.
Click here to access this article from the journal. It also served as my Bachelor degree thesis in 2015 at Lanzhou University. The thesis version (in Chinese) could be downloaded here.
Abstract
We count the number of matchings of order no more than six in $(4, 6)$-fullerene graphs. With a new recurrence method, closed formula for the number of matchings is obtained, based on the number of hexagon faces and some other structural indices. As preparation, we give a structural classification of $(4, 6)$-fullerene graphs and several induction results in $(4,6)$-fullerene graphs from local to global structure.