Automorphisms of trivalent graphs
classification
🧮 math.GT
keywords
graphsautomorphismstrivalentadjacentautomorphismboundarychangingcombinatorial
read the original abstract
Let $G_{g,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 $A_{g,b}$ of all automorphisms of graphs in $G_{g,b}$ showing that, up to suitable moves changing the graph within $G_{g,b}$, any such automorphism can be reduced to elementary switches of adjacent edges.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.