Counting Trees in a Certain Class of Graphs
From MaRDI portal
Cited in
(16)- The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
- On the average hitting times of the squares of cycles
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- Spanning tree formulas and Chebyshev polynomials
- Coding and counting spanning trees in Kleitman-Golden graphs
- Critical groups of graphs with dihedral actions
- Counting trees in directed regular multigraphs
- An efficient approach for counting the number of spanning trees in circulant and related graphs
- Counting spanning trees in the graphs of Kleitman and Golden and a generalization
- Spanning trees in directed square cycles
- On the sandpile group of the square cycle \(C^{2}_{n}\)
- Convex subgraphs and spanning trees of the square cycles
- Further analysis of the number of spanning trees in circulant graphs
- Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori
- Cycles and spanning trees
- The number of spanning trees in odd valent circulant graphs
This page was built for publication: Counting Trees in a Certain Class of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4050634)
