The critical group of a directed graph

Abstract

The critical group K(G) of a directed graph G=(V,E) is the cokernel of the transpose of the Laplacian matrix of G acting on the integer lattice Z^V. For undirected graphs G, this has been considered by Bacher, de la Harpe, and Nagnibeda, and by Biggs. We prove several things, among which are: K(G/p) is a subgroup of K(G) when p is an equitable partition and G is strongly connected; for undirected graphs, the torsion subgroup of K(G) depends only on the graphic matroid of G; and, the `dollar game' of Biggs can be generalized to give a combinatorial interpretation for the elements of K(G), when G is strongly connected.

23 pages

Cited by in corpus (15)

• Chip-Firing and Rotor-Routing on Directed Graphs
• On the Sandpile group of the cone of a graph
• On the critical ideals of graphs
• Graphs with two trivial critical ideals
• The distribution of sandpile groups of random graphs
• Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
• On a Cohen-Lenstra Heuristic for Jacobians of Random Graphs
• Chip-Firing Games and Critical Groups
• Counting Finite Index Subrings of ${\mathbb{Z}}^n$
• A Consistent Sandpile Torsor Algorithm for Regular Matroids
• Cyclic Critical Groups of Graphs
• Critical groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields: an extended abstract
• A Survey of directed graphs invariants
• On the critical group of matrices
• Compatible Recurrent Identities of the Sandpile Group and Maximal Stable Configurations