Express the number of spanning trees in term of degrees
Abstract
It is well-known that the number of spanning trees, denoted by τ(G), in a connected multi-graph G can be calculated by the Matrix-Tree theorem and Tutte's deletion-contraction theorem. In this short note, we find an alternate method to compute τ(G) by degrees of vertices.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.