Let Gg,b be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface Sg,b 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.
Silvia Benvenuti, Riccardo Piergallini (2013). Automorphisms of trivalent graphs. EUROPEAN JOURNAL OF COMBINATORICS, 34(-), 987-1009.
Automorphisms of trivalent graphs
Silvia Benvenuti
;Riccardo Piergallini
2013
Abstract
Let Gg,b be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface Sg,b 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.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
