Weierstrass points on graphs

A graph, or network, is a configuration of vertices and edges. On a fixed graph, we can place chips around on vertices and play the "chip-firing game." This has connections to constructions on algebraic curves.

Choose a graph:

Enter an adjacency matrix of a connected graph.

Enter vertices of \(G\)

Enter edges of \(G\)