Document Type

Article

Publication Date

1998

Publication Title

Journal of Combinatorial Theory Series B

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.

Share

COinS