Multiplicity-Free Gonality on Graphs

Abstract: The divisorial gonality of a graph is the minimum degree of a positive rank divisor on that graph. We introduce the multiplicity-free gonality of a graph, which restricts our consideration to divisors that place at most (1) chip on each vertex. We give a sufficient condition in terms of vertex-connectivity for these two versions of gonality to be equal; and we show that no function of gonality can bound multiplicity-free gonality, even for simple graphs. We also prove that multiplicity-free gonality is NP-hard to compute, while still determining it for graph families for which gonality is currently unknown. We also present new gonalities, such as for the wheel graphs.