Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink
From MaRDI portal
Publication:6570976
Recommendations
- Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip
- Counting spanning trees with a Kekulé structure in linear hexagonal chains
- scientific article; zbMATH DE number 4047772
- Perfect matchings in random pentagonal chains
- A theorem concerning perfect matchings in hexagonal systems
Cites work
- scientific article; zbMATH DE number 3895093 (Why is no real title available?)
- 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 of complete multipartite graphs containing a fixed spanning forest
- On graphs with a unique perfect matching
- On the Kirchhoff index and the number of spanning trees of cylinder/Möbius pentagonal chain
- Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
- The enumeration of spanning tree of weighted graphs
- The number of spanning trees of the Bruhat graph
- Trees with 1-factors and oriented trees
Cited in
(2)
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)