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

DOI10.1007/S10801-010-0235-7zbMath1225.05187OpenAlexW2090840276MaRDI QIDQ617324

Eric Swartz

Publication date: 21 January 2011

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

Full work available at URL: https://doi.org/10.1007/s10801-010-0235-7

zbMATH Keywords

polygonal graphalgebraic graph theory2-arc transitive graph

Mathematics Subject Classification ID

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

Related Items (2)

A family of near-polygonal graphs of valency 10 ⋮ Graphs that contain multiply transitive matchings

Cites Work

• Symmetrical path-cycle covers of a graph and polygonal graphs
• A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth
• Unnamed Item
• Unnamed Item

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