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

DOI10.1016/J.AMC.2024.128722zbMATH Open1545.05099MaRDI QIDQ6570976FDOQ6570976

Authors: Xiaoxu Ma, Yujun Yang 

Publication date: 11 July 2024

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

perfect matchingspanning treehexagonal chainturned hexagon

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Chemical graph theory (05C92)

Cites Work

• On graphs with a unique perfect matching
• Title not available (Why is that?)
• The enumeration of spanning tree of weighted graphs
• Trees with 1-factors and oriented trees
• The number of spanning trees of the Bruhat graph
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
• On the Kirchhoff index and the number of spanning trees of cylinder/Möbius pentagonal chain
• Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
• Counting spanning trees in a complete bipartite graph which contain a given spanning forest
• Counting spanning trees with a Kekulé structure in linear hexagonal chains

Cited In (1)

• Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip

This page was built for publication: Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570976)