On the number of spanning trees of K_ n and K_m,n
From MaRDI portal
Publication:912860
Recommendations
Cites work
Cited in
(23)- An approach to the performance of SPC product codes on the erasure channel
- scientific article; zbMATH DE number 4142059 (Why is no real title available?)
- The poset of subpartitions and Cayley's formula for the complexity of a complete graph
- Enumeration for no-trivial spanning forests of complete bipartite graphs.
- On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
- A new proof of Cayley's formula for labeled spanning trees
- scientific article; zbMATH DE number 2186889 (Why is no real title available?)
- Trees and Power-Sums
- Counting of spanning trees in complete graph \(K_p\) of even order
- Construction and counting of spanning tree in complete graph \(K_5\)
- Enumerating k-way trees
- On Cayley's formula for counting trees in nested interval graphs
- On two conjectures concerning spanning tree edge dependences of graphs
- The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
- The number of spanning trees in generalized complete multipartite graphs of Fan-type
- Construction and enumeration of spanning trees in a complete graph \(K_p\) of odd order
- On a conjecture regarding spanning tree edge dependences of planar graphs
- Types of special graphs and their complexity trees
- scientific article; zbMATH DE number 1778429 (Why is no real title available?)
- Some applications of spanning trees in \(K_{s,t}\)
- A formula for the number of spanning trees of \(K_{n^m}[G]\)
- Binomial identities generated by counting spanning trees.
- scientific article; zbMATH DE number 2104825 (Why is no real title available?)
This page was built for publication: On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912860)
