Graph Gonality Calculator

chip-firing divisor rank

All Tools

Loading tool...

About Graph Gonality Calculator

A graph gonality calculator computing gon(G): minimum degree of a divisor with positive rank in chip-firing/divisor theory. gon(tree)=1. gon(C_n)=2. gon(K_n)=n-1. Related to treewidth: gon≤tw+1. Tropical geometry connection. Client-side.

Graph Gonality Calculator Features

  • gon(G) value
  • Chip-firing
  • Divisor rank
  • tw+1 bound
  • Common graphs
Advertisement
Advertisement