Average rating
Cast your vote
You can rate an item by clicking the amount of stars they wish to award to this item.
When enough users have cast their vote on this item, the average rating will also be shown.
Star rating
Your vote was cast
Thank you for your feedback
Thank you for your feedback
Author
Northshield, SamDate Published
1998
Metadata
Show full item recordAbstract
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.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.1861Description
This article has been published in the November 1998 issue of Journal of Combinatorial Theory Series B.Collections