A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth
From MaRDI portal
Publication:986115
DOI10.1016/J.JCTA.2009.07.001zbMATH Open1214.05097OpenAlexW1993600558MaRDI QIDQ986115FDOQ986115
Authors: 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
Recommendations
Cites Work
Cited In (12)
- Graphs that contain multiply transitive matchings
- An infinite family of sharply two-arc transitive digraphs
- Title not available (Why is that?)
- Polygonal graphs
- A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary even girth
- Trivalent 2-arc transitive graphs of type \(G^1_2\) are near polygonal
- Symmetrical path-cycle covers of a graph and polygonal graphs
- A family of near-polygonal graphs of valency 10
- Two-arc transitive near-polygonal graphs
- A note on the girth-doubling construction for polygonal graphs
- On narrow hexagonal graphs with a 3-homogeneous suborbit
- An infinite family of vertex-primitive 2-arc-transitive digraphs
This page was built for publication: A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986115)