paper

Automorphisms of trivalent graphs

arXiv:1111.3515

Abstract

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

28 pages, 35 eps figures

Cited by in corpus (1)