Two-vertex generators of Jacobians of graphs
classification
🧮 math.CO
math.AG
keywords
differencedivisorsgraphsverticesallowsanswersbeckerconclude
read the original abstract
We give necessary and sufficient conditions under which the Jacobian of a graph is generated by a divisor that is the difference of two vertices. This answers a question posed by Becker and Glass and allows us to prove various other propositions about the order of divisors that are the difference of two vertices. We conclude with some conjectures about these divisors on random graphs and support them with empirical evidence.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.