Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink

Xiaoxu Ma and Yujun Yang

Applied Mathematics and Computation, 2024, vol. 475, issue C

Abstract: 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.

Keywords: Spanning tree; Perfect matching; Hexagonal chain; Turned hexagon (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324001942
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:475:y:2024:i:c:s0096300324001942

DOI: 10.1016/j.amc.2024.128722

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().