Mathematics > Combinatorics
arXiv:2606.21902 (math)
[Submitted on 20 Jun 2026]
Abstract:We prove a new combinatorial identity for the determinant of the resistance matrix of a finite graph, which involves counts of spanning trees and forests. This generalizes a result of Graham and Pollak on distances matrices of trees. We make use of Bapat's expression of the resistance matrix determinant as a linear algebraic quantity.
Submission history
From: Harry Richman [view email]
[v1]
Sat, 20 Jun 2026 06:38:38 UTC (15 KB)
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.























