Counting Trees in a Certain Class of Graphs

DOI10.2307/2319131zbMath0297.05123OpenAlexW4241699458MaRDI QIDQ4050634

Bruce L. Golden, Daniel J. Kleitman

Publication date: 1975

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2319131

Mathematics Subject Classification ID

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

Related Items (15)

On the average hitting times of the squares of cycles ⋮ The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\) ⋮ On the sandpile group of the square cycle \(C^{2}_{n}\) ⋮ Spanning tree formulas and Chebyshev polynomials ⋮ Further analysis of the number of spanning trees in circulant graphs ⋮ Coding and counting spanning trees in Kleitman-Golden graphs ⋮ Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori ⋮ Critical groups of graphs with dihedral actions ⋮ Unnamed Item ⋮ Cycles and spanning trees ⋮ An efficient approach for counting the number of spanning trees in circulant and related graphs ⋮ Counting trees in directed regular multigraphs ⋮ The number of spanning trees in odd valent circulant graphs ⋮ Chebyshev polynomials and spanning tree formulas for circulant and related graphs ⋮ Counting spanning trees in the graphs of Kleitman and Golden and a generalization

This page was built for publication: Counting Trees in a Certain Class of Graphs