Automorphisms of trivalent graphs
Geometric Topology
2011-11-16 v1
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.
Cite
@article{arxiv.1111.3515,
title = {Automorphisms of trivalent graphs},
author = {Silvia Benvenuti and Riccardo Piergallini},
journal= {arXiv preprint arXiv:1111.3515},
year = {2011}
}
Comments
28 pages, 35 eps figures