Coding and counting spanning trees in Kleitman-Golden graphs
From MaRDI portal
Recommendations
Cites work
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Baxter algebras and combinatorial identities. II
- Coding and counting spanning trees in Kleitman-Golden graphs
- Counting spanning trees in the graphs of Kleitman and Golden and a generalization
- Counting Trees in a Certain Class of Graphs
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3941580 (Why is no real title available?)
- Matrix tree theorems
- Spanning tree formulas and Chebyshev polynomials
- The Fibonacci numbers via trigonometric expressions
Cited in
(5)- Counting spanning trees in the graphs of Kleitman and Golden and a generalization
- Spanning forests and the golden ratio
- Coding and counting spanning trees in Kleitman-Golden graphs
- scientific article; zbMATH DE number 140113 (Why is no real title available?)
- Counting and coding identity trees with fixed diameter and bounded degree
This page was built for publication: Coding and counting spanning trees in Kleitman-Golden graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4007354)