The critical group of a directed graph

Details The critical group of a directed graph The critical group of a directed graph

2000-10-25

arxiv.org/abs/math/0010241v1

Mathematics

Combinatorics

23 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The critical group of a directed graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The critical group of a directed graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The critical group of a directed graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-105744