Title of article
A New Proof of Cayleyʼs Formula for Labeled Spanning Trees
Author/Authors
Ariannejad، نويسنده , , M. Reza Emami، نويسنده , , M.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
4
From page
99
To page
102
Abstract
Cayleysʼs formula for enumerating spanning trees in complete graphs is one of the main theorems in this topic. In this note based on a new recursive method for the enumeration of spanning trees and meanwhile enumerating spanning trees in a kind of complete multigraph, a new proof for the Cayleyʼs formula is given. A generalization of this formula is also presented.
Keywords
Cayleys?s formula , spanning tree
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2014
Journal title
Electronic Notes in Discrete Mathematics
Record number
1456536
Link To Document