A theorem on trees.
From MaRDI portal
Cited in
(6)- Tree enumeration polynomials on separable permutations
- The number of spanning trees in a superprism
- The number of spanning trees of \(E\)-extended power graphs associated with finite semigroups
- Counting spanning trees of multiple complete split-like graph containing a given spanning forest
- A Telescopic Proof of Cayley’s Formula
- Automata and coalgebras in categories of species
This page was built for publication: A theorem on trees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1535643)