Automorphisms of trivalent graphs

Abstract

Let Gg,b be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface of genus g with b boundary components. We describe the set Ag,b of all automorphisms of graphs in Gg,b showing that, up to suitable moves changing the graph within Gg,b, any such automorphism can be reduced to elementary switches of adjacent edges.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…