arXiv Analytics

Sign in

arXiv:1909.12839 [math.CO]AbstractReferencesReviewsResources

A novel count of the spanning trees of a cube

Thomas W. Mattman

Published 2019-09-27Version 1

Using the special value at $u=1$ of the Artin-Ihara $L$-function, we give a short proof of the count of the number of spanning trees in the $n$-cube.

Comments: 2 pages
Categories: math.CO
Subjects: 05C30, 05C05, 05C25
Related articles: Most relevant | Search more
arXiv:0710.3044 [math.CO] (Published 2007-10-16, updated 2007-10-26)
A Short Proof of the VPN Tree Routing Conjecture on Ring Networks
arXiv:1402.7326 [math.CO] (Published 2014-02-28)
Analysis of the parallel peeling algorithm: a short proof
arXiv:math/9811036 [math.CO] (Published 1998-11-06)
A short proof that ``proper = unit''

Links

Toolbox