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

DOI10.1016/j.dam.2024.07.026zbMATH Open1547.05059MaRDI QIDQ6611077

Weigen Yan, Xing Feng, Danyi Li

Publication date: 26 September 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

spanning treecylinderperfect matchingMöbius striphexagonal lattice

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs with a unique perfect matching
• The energy of random graphs
• On the number of Kekulé structures in capped zigzag nanotubes
• Complete solution to a conjecture on the maximal energy of unicyclic graphs
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Trees with 1-factors and oriented trees
• Spanning trees on hypercubic lattices and nonorientable surfaces
• Dimer statistics on the Möbius strip and the Klein bottle
• Trees and matchings
• On the number of spanning trees of some irregular line graphs
• Enumeration of spanning trees of graphs with rotational symmetry
• The number of spanning trees of plane graphs with reflective symmetry
• On the entropy of spanning trees on a large triangular lattice
• Graph Energy
• On the number of spanning trees on various lattices
• DIMERS ON TWO-DIMENSIONAL LATTICES
• Spanning trees on graphs and lattices inddimensions
• A simple formula for the number of spanning trees of line graphs
• Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
• The second moment of the complexity of a graph
• Some exact results for spanning trees on lattices
• Spanning trees on lattices and integral identities
• Asymptotic Enumeration of Spanning Trees
• 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
• Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink

This page was built for publication: Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip