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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
