Two-vertex generators of Jacobians of graphs (Q1700775)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two-vertex generators of Jacobians of graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-vertex generators of Jacobians of graphs |
scientific article |
Statements
Two-vertex generators of Jacobians of graphs (English)
0 references
22 February 2018
0 references
Summary: 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 \textit{R. Becker} and \textit{D. B. Glass} [Australas. J. Comb. 64, 366--375 (2016; Zbl 1333.05254)] 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.
0 references
sandpile groups
0 references
critical groups
0 references
Jacobians of graphs
0 references
0.8756202
0 references
0 references
0.8669404
0 references
0.86663675
0 references
0.8626252
0 references
0 references
0.85990804
0 references
