Counting spanning trees with a Kekulé structure in linear hexagonal chains

DOI10.1016/j.amc.2023.128125OpenAlexW4378554088MaRDI QIDQ6108002

Weigen Yan, Danyi Li

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

zbMATH Keywords

perfect matchingKekulé structurematrix-tree theoremlinear hexagonal chainspanning treesdual graph

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
• On graphs with a unique perfect matching
• Kekulé structures of square-hexagonal chains and the Hosoya index of caterpillar trees
• Enumerating spanning trees of graphs with an involution
• Trees with 1-factors and oriented trees
• The number of spanning trees of the Bruhat graph
• The enumeration of spanning tree of weighted graphs
• Linear algebraic techniques for weighted spanning tree enumeration
• On the number of spanning trees of some irregular line graphs
• A simple formula for the number of spanning trees of line graphs
• The average Wiener index of hexagonal chains
• Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs

This page was built for publication: Counting spanning trees with a Kekulé structure in linear hexagonal chains