The number of spanning tree in several classes of graphs
From MaRDI portal
Recommendations
Cited in
(21)- Spanning tree formulas and Chebyshev polynomials
- Number of spanning trees of different products of complete and complete bipartite graphs
- The number of spanning forests of a graph
- On numbers of vertices of maximum degree in the spanning trees of a graph
- The number of spanning trees of plane graphs with reflective symmetry
- Counting graphs with different numbers of spanning trees through the counting of prime partitions
- scientific article; zbMATH DE number 6719620 (Why is no real title available?)
- scientific article; zbMATH DE number 2127724 (Why is no real title available?)
- scientific article; zbMATH DE number 5139506 (Why is no real title available?)
- The number of spanning trees in a class of double fixed-step loop networks
- Recursive relations for the number of spanning trees
- A note on the number of spanning trees in a prism graph
- The number of spanning trees in a prism
- Counting spanning trees in prism and anti-prism graphs
- scientific article; zbMATH DE number 5174860 (Why is no real title available?)
- scientific article; zbMATH DE number 5584928 (Why is no real title available?)
- scientific article; zbMATH DE number 5497806 (Why is no real title available?)
- Enumeration of spanning trees in prisms of some graphs
- The number of spanning trees in a superprism
- The number of spanning trees in self-similar graphs
- The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
This page was built for publication: The number of spanning tree in several classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3640122)
