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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。