Farbod Shokrieh

activity

20092026

most citedChip-firing games, potential theory on graphs, and spanning trees

109 citations · 289 across the 23 of their papers we have counts for

collaborators

Showing 2009Show all

2 papers · 1 filter

math.CO2009★ 13 cited

The monodromy pairing and discrete logarithm on the Jacobian of finite graphs

Farbod Shokrieh

Every graph has a canonical finite abelian group attached to it. This group has appeared in the literature under a variety of names including the sandpile group, critical group, Ja…

math.CO2009★ 3 cited

Chip-Firing Games, $G$ -Parking Functions, and an Efficient Bijective Proof of the Matrix-Tree Theorem

Farbod Shokrieh

Kirchhoff's matrix-tree theorem states that the number of spanning trees of a graph G is equal to the value of the determinant of the reduced Laplacian of $G$ . We outline an effici…

The monodromy pairing and discrete logarithm on the Jacobian of finite graphs

Chip-Firing Games, G-Parking Functions, and an Efficient Bijective Proof of the Matrix-Tree Theorem

Chip-Firing Games, $G$ -Parking Functions, and an Efficient Bijective Proof of the Matrix-Tree Theorem