Upper bounds of orders of automorphism groups of leafless metric graphs

Yusuke Nakamura, JuAe Song

We prove a tropical analogue of the theorem of Hurwitz: a leafless metric graph of genus $g\ge 2$ has at most $12$ automorphisms when $g=2$; $2^{g}g!$ automorphisms when $g \ge 3…