Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences

TL;DR

This work tackles the challenge of enumerating all arborescences in a digraph by representing them through the Kirchhoff polynomial $\kappa(G)$ and deriving a novel, structure-aware prime-factorization approach. By developing two graph-decomposition rules—one based on SCCs and the other on domination relations—the authors obtain a linear-time method to factor $\kappa(G)$ into prime components, preserving key connectivity properties. The resulting compressed representation facilitates practical symbolic computations (e.g., GCDs, steady states under Laplacian dynamics) and serves as a preprocessing step for existing or recursive deletion-contraction enumeration. The approach identifies a class of practically enumerable digraphs and demonstrates substantial compression across real-world networks, offering new angles for efficient arborescence enumeration and graph-theoretic insights into Kirchhoff polynomials.

Abstract

We study the problem of enumerating all rooted directed spanning trees (arborescences) of a directed graph (digraph) $G=(V,E)$ of $n$ vertices. An arborescence $A$ consisting of edges $e_1,\ldots,e_{n-1}$ can be represented as a monomial $e_1\cdot e_2 \cdots e_{n-1}$ in variables $e \in E$. All arborescences $\mathsf{arb}(G)$ of a digraph then define the Kirchhoff polynomial $\sum_{A \in \mathsf{arb}(G)} \prod_{e\in A} e$. We show how to compute a compact representation of the Kirchhoff polynomial -- its prime factorization, and how it relates to combinatorial properties of digraphs such as strong connectivity and vertex domination. In particular, we provide digraph decomposition rules that correspond to factorization steps of the polynomial, and also give necessary and sufficient primality conditions of the resulting factors expressed by connectivity properties of the corresponding decomposed components. Thereby, we obtain a linear time algorithm for decomposing a digraph into components corresponding to factors of the initial polynomial, and a guarantee that no finer factorization is possible. The decomposition serves as a starting point for a recursive deletion-contraction algorithm, and also as a preprocessing phase for iterative enumeration algorithms. Both approaches produce a compressed output and retain some structural properties in the resulting polynomial. This proves advantageous in practical applications such as calculating steady states on digraphs governed by Laplacian dynamics, or computing the greatest common divisor of Kirchhoff polynomials. Finally, we initiate the study of a class of digraphs which allow for a practical enumeration of arborescences. Using our decomposition rules we observe that various digraphs from real-world applications fall into this class or are structurally similar to it.

Figures (4)

• Figure 1: Left: A digraph with one trivial (the initial vertex) and four non-trivial strongly connected components (here cycles), each induced by the edges $\{x_1,x_2,x_3\}$, $x\in \{a,b,c,d\}$. The gray area depicts one such strongly connected component $G[V']$. Right: An illustration of $\widehat{G[V']}$.
• Figure 2: Example of a digraph (left) and its decomposition using strongly connected components (right). The edges in black are part of a strongly connected component and the edges in red are connecting different SCCs.
• Figure 3: Kirchhoff polynomial factorization of a digraph with respect to its dominator tree (above). The dominator tree of the example digraph (below). Color coding corresponds to immediate domination.
• Figure 4: Example of a digraph that requires SCC decomposition followed by dominators decomposition and another SCC decomposition to obtain prime factorization.

Theorems & Definitions (30)

• Definition 2.3
• Definition 2.4: Domination
• Definition 2.5: Immediate Domination
• Definition 2.6: Contraction
• Proposition 3.1
• Proposition 3.2
• Lemma 3.3
• proof
• Theorem 3.4
• proof