A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth

DOI10.1016/J.JCTA.2009.07.001zbMath1214.05097OpenAlexW1993600558MaRDI QIDQ986115

Eric Swartz

Publication date: 11 August 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2009.07.001

zbMATH Keywords

graph automorphismspolygonal graphs2-arc transitive graphs

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

A family of near-polygonal graphs of valency 10 ⋮ A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary even girth ⋮ Graphs that contain multiply transitive matchings

Cites Work

• Symmetrical path-cycle covers of a graph and polygonal graphs
• Generalized reflection groups. II
• Bounding the Valency of Polygonal Graphs With Odd Girth
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth