Enumeration of spanning trees containing a perfect matching in linear polygonal chains

DOI10.1016/J.AMC.2024.128882MaRDI QIDQ6993882zbMATH OpenFDO

Authors Jingchao Lai, Rongkun Zhu

Publication date 24 April 2025

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

Full work available at URL https://doi.org/10.1016/J.AMC.2024.128882

zbMATH Keywords

linear polygonal chainsperfect matchingpm-treespanning tree

Mathematics Subject Classification ID

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

Cites work

• A simple formula for the number of spanning trees of line graphs
• Counting spanning trees with a Kekulé structure in linear hexagonal chains
• Determinant identities for Laplace matrices
• Enumerating spanning trees of graphs with an involution
• Expression for the number of spanning trees of line graphs of arbitrary connected graphs
• scientific article; zbMATH DE number 3895093 (Why is no real title available?)
• Linear algebraic techniques for weighted spanning tree enumeration
• On graphs with a unique perfect matching
• Simplicial matrix-tree theorems
• Spanning trees of dual graphs
• The number of spanning trees of the Bruhat graph
• Trees with 1-factors and oriented trees

Cited in

(4)

• Counting spanning trees with one perfect matching in helicene polygonal chains on the plane and cylinder
• Resistance distance and spanning trees of multiple extended complete split-like graph
• Counting matchable spanning trees of join graphs
• Enumeration of spanning trees containing a perfect matching in saturated non-covered graphs

This page was built for publication: Enumeration of spanning trees containing a perfect matching in linear polygonal chains

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