Principal minors of tree distance matrices
Combinatorics
2025-12-11 v2
Abstract
We prove that the principal minors of the distance matrix of a tree satisfy a combinatorial expression involving counts of rooted spanning forests of the underlying tree. This generalizes a result of Graham and Pollak, and refines a result of Graham and Lov\'asz on the coefficients of the characteristic polynomial of the distance matrix. We also give such an expression for the case of trees with edge lengths. We use arguments motivated by potential theory on graphs. Our formulas can be expressed in terms of evaluations of Symanzik polynomials.
Keywords
Cite
@article{arxiv.2411.11488,
title = {Principal minors of tree distance matrices},
author = {Harry Richman and Farbod Shokrieh and Chenxi Wu},
journal= {arXiv preprint arXiv:2411.11488},
year = {2025}
}
Comments
v2: 26 pages, 8 figures, comments welcome!