Hexagonal chains are graph representations of benzenoid polymers which are common but important molecular structures in chemistry. A spanning tree of a graph is a subgraph which is a tree and contains all the vertices of the graph. A perfect matching of a graph is a set of disjoint edges covering all vertices of the graph. In this paper, we give exact expression for the number of spanning trees containing perfect matchings in hexagonal chains with a unique kink.

中文翻译：

---

枚举包含具有独特扭结的六角链中完美匹配的生成树

六角链是苯环聚合物的图形表示，苯环聚合物是化学中常见但重要的分子结构。图的生成树是一个子图，它是一棵树，包含图的所有顶点。图的完美匹配是覆盖图的所有顶点的一组不相交的边。在本文中，我们给出了具有独特扭结的六边形链中包含完美匹配的生成树数量的精确表达式。