Counting spanning trees with a Kekulé structure in linear hexagonal chains
From MaRDI portal
Publication:6108002
DOI10.1016/J.AMC.2023.128125OpenAlexW4378554088MaRDI QIDQ6108002FDOQ6108002
Authors: Danyi Li, Weigen Yan
Publication date: 29 June 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2023.128125
Recommendations
- Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip
- Kekulé structures of hexagonal chains -- some unusual connections
- Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink
- Kekulé structures of square-hexagonal chains and the Hosoya index of caterpillar trees
- On the Kirchhoff index and the number of spanning trees of cylinder/Möbius pentagonal chain
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
- Enumerating spanning trees of graphs with an involution
- A simple formula for the number of spanning trees of line graphs
- On graphs with a unique perfect matching
- The average Wiener index of hexagonal chains
- On the number of spanning trees of some irregular line graphs
- The enumeration of spanning tree of weighted graphs
- Trees with 1-factors and oriented trees
- Kekulé structures of square-hexagonal chains and the Hosoya index of caterpillar trees
- Linear algebraic techniques for weighted spanning tree enumeration
- The number of spanning trees of the Bruhat graph
- Expression for the number of spanning trees of line graphs of arbitrary connected graphs
Cited In (5)
- Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink
- Matching polynomials and independence polynomials of benzenoid chains
- Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip
- Counting spanning trees of multiple complete split-like graph containing a given spanning forest
- Resistance distances in generalized join graphs
This page was built for publication: Counting spanning trees with a Kekulé structure in linear hexagonal chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108002)