Gluing Formula for the Pseudo-Determinant of Graph Laplacian and Applications to Counting of Spanning Trees
Shivjyot Brar, Sheng-Chang Chen, Sayonita Ghosh Hajra, Santosh Kandel
Abstract
In this paper, we establish a gluing formula for the pseudo-determinant of the Laplacian on a simple finite graph. We achieve this by using the gluing formula for the determinant of massive Laplacian and the perturbation theory technique. In addition, we apply this gluing relation to derive a gluing formula for the number of spanning trees and rooted spanning forests on simple finite graphs.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato