Automorphisms of trivalent graphs

2011/11/15 by Silvia Benvenuti, Benvenuti, Silvia, Riccardo Piergallini +1 · 4 citations
Computer Science · Mathematics · #05C25 #20B25 #57M50 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Geometric Topology (math.GT) #Geometric and Algebraic Topology

paper · pdf · doi:10.48550/arxiv.1111.3515

openalex publication_date 2011/11/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• The Monster group is a completion of the Goldschmidt G3-amalgam
• On tetravalent half-arc-transitive graphs
• On cubic vertex-transitive graphs of given girth
• Edge-transitive token graphs as covers

Related

• On Factor-Invariant Graphs With Two Cycles
• Automorphism groups of maps, surfaces and Smarandache geometries
• Automorphisms of the fine curve graph
• Automorphisms of the fine curve graph
• Finite edge-transitive oriented graphs of valency four: a global\n approach