A Novel Count of the Spanning Trees of a Cube

IF 0.6 4区数学 Q3 MATHEMATICS

Graphs and Combinatorics Pub Date : 2024-01-28 DOI:10.1007/s00373-023-02746-5

Thomas W. Mattman

引用次数: 0

Abstract

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.

查看原文本刊更多论文

立方体生成树的新计数法

利用阿尔丁-伊哈拉 L 函数在 \(u=1\)处的特殊值，我们给出了 n 立方体中生成树数目的简短证明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Graphs and Combinatorics 数学-数学

CiteScore

1.00

自引率

14.30%

发文量

160

审稿时长

6 months

期刊介绍： Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.