English

The Jacobian of a graph and graph automorphisms

Combinatorics 2024-07-19 v5 Algebraic Geometry Group Theory

Abstract

In the present paper we investigate the faithfulness of certain linear representations of groups of automorphisms of a graph XX in the group of symmetries of the Jacobian of XX. As a consequence we show that if a 33-edge-connected graph XX admits a nonabelian semiregular group of automorphims, then the Jacobian of XX cannot be cyclic. In particular, Cayley graphs of degree at least three arising from nonabelian groups have non-cyclic Jacobians. While the size of the Jacobian of XX is well-understood - it is equal to the number of spanning trees of XX - the combinatorial interpretation of the rank of Jacobian of a graph is unknown. Our paper presents a contribution in this direction.

Keywords

Cite

@article{arxiv.2206.01469,
  title  = {The Jacobian of a graph and graph automorphisms},
  author = {István Estélyi and Ján Karabáš and Alexander Mednykh and Roman Nedela},
  journal= {arXiv preprint arXiv:2206.01469},
  year   = {2024}
}