Express the number of spanning trees in term of degrees
From MaRDI portal
Publication:2247149
Recommendations
Cites work
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- A simple formula for the number of spanning trees of line graphs
- A survey of the theory of hypercube graphs
- An Analysis of the Wang Algebra of Networks
- Enumeration of spanning trees of middle graphs
- Expression for the number of spanning trees of line graphs of arbitrary connected graphs
- Graph-polynomials
- Spanning trees and orientation of graphs
- Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
- The Enumeration of Point Labelled Chromatic Graphs and Trees
- The second moment of the complexity of a graph
Cited in
(6)- Counting spanning trees in a complete bipartite graph which contain a given spanning forest
- Enumeration of spanning trees of middle graphs
- Expression for the number of spanning trees of line graphs of arbitrary connected graphs
- scientific article; zbMATH DE number 5532173 (Why is no real title available?)
- Express the number of spanning trees in term of degrees
- scientific article; zbMATH DE number 3987294 (Why is no real title available?)
This page was built for publication: Express the number of spanning trees in term of degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2247149)