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 named graph: Frucht graph Pappus graph Triangle prism graph Franklin graph Truncated tetrahedron graph Dürer graph Bidiakis cube graph

• Generate a random cubic (3-regular) graph:
  Number of vertices (even, ≥ 4): Generate
• Enter the adjacency matrix of a connected graph:
  [[0,1,1,0],[1,0,1,1],[1,1,0,1],[0,1,1,0]]

  Submit data