Counting spanning trees in grid graphs

MaRDI QIDQ2716534zbMATH OpenFDO

Authors Melissa Desjarlais, Robert R. Molina

Publication date 2 January 2002

Published in Congressus Numerantium (Search for Journal in Brave)

zbMATH Keywords

grid graphsmatrix tree theoremspanning forestsspanning trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Linear algebraic techniques for spanning tree enumeration
• Counting spanning trees in the graphs of Kleitman and Golden and a generalization
• Asymptotic enumeration theorem for the number of spanning trees in grids and tori
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• The number of spanning trees in circulant graphs

Cited in

(9)

• Counting spanning trees in the graphs of Kleitman and Golden and a generalization
• On the number of spanning trees in graphs with multiple edges
• Counting trees with random walks
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Asymptotic enumeration theorem for the number of spanning trees in grids and tori
• scientific article; zbMATH DE number 5532173 (Why is no real title available?)
• scientific article; zbMATH DE number 2094529 (Why is no real title available?)
• Linear algebraic techniques for spanning tree enumeration
• Spanning tree bounds for grid graphs

This page was built for publication: Counting spanning trees in grid graphs

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