A note on the Zeta Function of a Graph
Loading...
Issue Date
1998
Authors
Northshield, Sam
Publisher
Journal of Combinatorial Theory Series B
Keywords
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.