Jacobian of a graph and graph automorphisms

MaRDI QIDQ6506012arXivFDO

Authors István Estélyi, Ján Karabáš, Alexander Mednykh, Roman Nedela

Published in arXiv

Mathematics Subject Classification ID

Flows in graphs (05C21) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Abstract: In the present paper we investigate the faithfulness of certain linear representations of groups of automorphisms of a graph $X$ in the group of symmetries of the Jacobian of $X$. As a consequence we show that if $X$ is not a cycle and it admits a non-abelian semiregular group of automorphims, then the Jacobian of $X$ cannot be cyclic. While the size of the Jacobian of $X$ is well-understood -- its size is equal to the number of spanning trees, the combinatorial interpretation of the rank of Jacobian of a graph is unknown. Our paper presents a contribution in this direction, in particular we have proved that Cayley graphs of degree at least three based on non-abelian groups have non-cyclic Jacobians.

This page was built for publication: Jacobian of a graph and graph automorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6506012)