A new proof of Bartholdi's theorem (Q2574980): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10801-005-4526-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2079430784 / rank | |||
Normal rank |
Revision as of 00:04, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new proof of Bartholdi's theorem |
scientific article |
Statements
A new proof of Bartholdi's theorem (English)
0 references
5 December 2005
0 references
Bartholdi's theorem gives two formulas for the reciprocal of the Bartholdi zeta function of a connected graph \(G\), in terms of the order and size of \(G\) and various matrices [\textit{L. Bartholdi}, Enseign. Math., II. Sér. 45, No. 1--2, 83--131 (1999; Zbl 0961.05032)]. The present authors give a new and shorter proof of this theorem, using linear algebra for the first formula, and a combinatorial argument for the second one.
0 references
zeta function
0 references
graph
0 references
cycle
0 references
bump
0 references