1 citations · 1 across the 3 of their papers we have counts for
3 papers
The gonality of circulant graphs
Lisa Cenek, Lizzie Ferguson, Eyobel Gebre +5
The gonality of a graph measures how difficult it is to move chips around the entirety of a graph according to certain chip-firing rules without introducing debt. In this paper we…
Finding the root in random nearest neighbor trees
Anna Brandenberger, Cassandra Marcussen, Elchanan Mossel +1
We study the inference of network archaeology in growing random geometric graphs. We consider the root finding problem for a random nearest neighbor tree in dimension $d \in \mathb…
Scramble number and tree-cut decompositions
Lisa Cenek, Lizzie Ferguson, Eyobel Gebre +6
The scramble number of a graph is an invariant recently developed to study chip-firing games and divisorial gonality. In this paper we introduce the screewidth of a graph, based on…