Coding and counting spanning trees in Kleitman-Golden graphs
From MaRDI portal
Publication:4007354
DOI10.1007/BF01068310zbMath0766.05036OpenAlexW2058670276MaRDI QIDQ4007354
Publication date: 27 September 1992
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01068310
Trees (05C05) Enumeration in graph theory (05C30) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Counting spanning trees in the graphs of Kleitman and Golden and a generalization
- Spanning tree formulas and Chebyshev polynomials
- The Fibonacci numbers via trigonometric expressions
- Matrix tree theorems
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Coding and counting spanning trees in Kleitman-Golden graphs
- Counting Trees in a Certain Class of Graphs
- Baxter algebras and combinatorial identities. II