Trivalent 2-arc transitive graphs of type \(G^1_2\) are near polygonal

DOI10.1007/s00026-010-0066-1zbMath1235.05065OpenAlexW2172168235MaRDI QIDQ659590

Sanming Zhou

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-010-0066-1

zbMATH Keywords

symmetric grapharc-transitive graphnear polygonal graphthree-arc graphtrivalent symmetric graph

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

On a class of finite symmetric graphs ⋮ A class of symmetric graphs with 2-arc transitive quotients

Cites Work

• Imprimitive symmetric graphs, 3-arc graphs and 1-designs
• Automorphism groups of symmetric graphs of valency 3
• On a class of finite symmetric graphs
• Almost covers of 2-arc transitive graphs
• Bounding the Valency of Polygonal Graphs With Odd Girth
• A class of finite symmetric graphs with 2-arc transitive quotients
• On narrow hexagonal graphs with a 3-homogeneous suborbit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item