[Paper Review] Counting the spanning trees of a directed line graph

Hoda Bidkhori, Shaunak Kishore|ArXiv.org|Oct 19, 2009

Complex Network Analysis Techniques5 references3 citations

TL;DR

This paper provides a bijective proof of a generating function identity generalizing Knuth's formula for counting spanning trees in directed line graphs, establishing a connection between binary de Bruijn sequences and binary sequences of length $2^{n-1}$. It further determines the critical groups of all Kautz and de Bruijn graphs, generalizing prior results by Levine and offering explicit group structures via direct sum decompositions of cyclic groups based on graph parameters.

ABSTRACT

The line graph LG of a directed graph G has a vertex for every edge of G and an edge for every path of length 2 in G. In 1967, Knuth used the Matrix-Tree Theorem to prove a formula for the number of spanning trees of LG, and he asked for a bijective proof. In this paper, we give a bijective proof of a generating function identity due to Levine which generalizes Knuth's formula. As a result of this proof we find a bijection between binary de Bruijn sequences of degree n and binary sequences of length 2^{n-1}. Finally, we determine the critical groups of all the Kautz graphs and de Bruijn graphs, generalizing a result of Levine.

Motivation & Objective

• To provide a bijective proof of Levine’s generating function identity, which generalizes Knuth’s formula for the number of spanning trees in the line graph of a directed graph.
• To resolve Stanley’s open problem by constructing an explicit bijection between binary de Bruijn sequences of degree $n$ and binary sequences of length $2^{n-1}$.
• To determine the complete structure of the critical groups of all Kautz graphs $\mathrm{Kautz}_n(m)$ and de Bruijn graphs $DB_n(m)$, extending previous results for prime $m$.

Proposed method

• Construct a bijective correspondence between edge-weighted spanning trees in the original graph and vertex-weighted spanning trees in its line graph, using generating functions indexed by edge and vertex variables.
• Leverage the Matrix-Tree Theorem and linear algebraic identities to derive the generating function relation, then provide a combinatorial bijection that preserves the structure of the spanning trees.
• Use induction on $n$ to compute the Sylow $p$-subgroups of the critical groups for $DB_n(m)$ and $\mathrm{Kautz}_n(m)$, analyzing the $p$-adic valuation of the number of spanning trees.
• Apply the structure theorem for finite abelian groups to decompose the critical groups into direct sums of cyclic $p$-groups, determining the exponents via recursive counting of $p$-powers in the order of the group.
• Verify the inductive step by matching the $p$-adic valuation of the group order with the sum of exponents in the cyclic decomposition, ensuring consistency across all primes dividing $m$.
• Generalize previous results by Levine, who only computed the critical groups for prime $m$, to arbitrary $m$ by analyzing the group structure through Sylow theory and recursive line graph iteration.

Experimental results

Research questions

• RQ1 Can a bijective proof be constructed for Levine’s generating function identity that generalizes Knuth’s formula for spanning trees in directed line graphs?
• RQ2 Is there a natural explicit bijection between the set of binary de Bruijn sequences of degree $n$ and the set of binary sequences of length $2^{n-1}$?
• RQ3 What is the complete structure of the critical group of the de Bruijn graph $DB_n(m)$ for arbitrary $m$?
• RQ4 What is the complete structure of the critical group of the Kautz graph $\mathrm{Kautz}_n(m)$ for arbitrary $m$?
• RQ5 How do the critical groups of iterated line graphs $\mathrm{Kautz}_n(m)$ and $DB_n(m)$ decompose into cyclic $p$-groups for each prime $p$ dividing $m$?

Key findings

• The critical group of $DB_n(m)$ is isomorphic to $\left(\mathbb{Z}_{m^n}\right)^{m-2} \oplus \bigoplus_{i=1}^{n-1} \left(\mathbb{Z}_{m^i}\right)^{m^{n-1-i}(m-1)^2}$, providing a complete decomposition for all $m$.
• The critical group of $\mathrm{Kautz}_n(m)$ is isomorphic to $\left(\mathbb{Z}_{m+1}\right)^{m-1} \oplus \left(\mathbb{Z}_{m^{n-1}}\right)^{m^2-2} \oplus \bigoplus_{i=1}^{n-2} \left(\mathbb{Z}_{m^i}\right)^{m^{n-2-i}(m-1)^2(m+1)}$, extending Levine’s result to all $m$.
• A bijection is constructed between the set of binary de Bruijn sequences of degree $n$ and the set of binary sequences of length $2^{n-1}$, resolving Stanley’s Exercise 5.73.
• The Sylow $p$-subgroup of $K(DB_n(m))$ is $\left(\mathbb{Z}_{p^{nk}}\right)^{m-2} \oplus \bigoplus_{i=1}^{n-1} \left(\mathbb{Z}_{p^{ik}}\right)^{m^{n-1-i}(m-1)^2}$, where $p^k$ is the largest power of $p$ dividing $m$, and trivial otherwise.
• For $\mathrm{Kautz}_n(m)$, the Sylow $p$-subgroup is $\left(\mathbb{Z}_{p^{(n-1)k}}\right)^{m^2-2} \oplus \bigoplus_{i=1}^{n-2} \left(\mathbb{Z}_{p^{ik}}\right)^{m^{n-2-i}(m-1)^2(m+1)}$, with $a_k = m^{n-2}(m-1)^2$ for $n > 2$, and $a_k = m^2 - 2$ for $n = 2$.
• The critical groups of both $DB_n(m)$ and $\mathrm{Kautz}_n(m)$ are fully characterized as direct sums of cyclic $p$-groups, with exponents determined by recursive counting of $p$-adic valuations in the number of spanning trees.