Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903091 | Discrete Mathematics | 2018 | 7 Pages |
Abstract
Let G be a finite connected graph. In this note, we show that the complexity of G can be obtained from the partial derivatives at (1â1t,t) of a determinant in terms of the Bartholdi zeta function of G. Moreover, the second order partial derivatives at (1â1t,t) of this determinant can all be expressed as the linear combination of the Kirchhoff index, the additive degree-Kirchhoff index, and the multiplicative degree-Kirchhoff index of the graph G.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Deqiong Li, Yaoping Hou,