A note on the Zeta Function of a Graph
Loading...
Authors
Northshield, Sam
Issue Date
1998
Type
Article
Language
en
Keywords
Alternative Title
Abstract
The number of splanning trees in a finite graph is first expressed as the derivative (at 1) of a determinant and then in terms of a zeta function. This generalizes a result of Hashimoto to non-regular graphs.
Description
This article has been published in the November 1998 issue of Journal of Combinatorial Theory Series B.
Citation
Northshield, S. (1998). A note on the Zeta Function of a Graph. Journal of Combinatorial Theory Series B, 74. http://doi.org/10.1006/jctb.1998.1861
Publisher
Journal of Combinatorial Theory Series B