Results 101 to 110 of about 76,199 (200)

Upper bounds of orders of automorphism groups of leafless metric graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
We prove a tropical analogue of the theorem of Hurwitz: A leafless metric graph of genus [Formula: see text] has at most 12 automorphisms when g = 2 and [Formula: see text] automorphisms when [Formula: see text].
Yusuke Nakamura, JuAe Song
doaj   +1 more source

Home - About - Disclaimer - Privacy