ELibM Journals • ELibM Home • EMIS Home • EMIS Mirrors

  EMIS Electronic Library of Mathematics (ELibM)
The Open Access Repository of Mathematics
  EMIS ELibM Electronic Journals

JOURNAL OF
ALGEBRAIC
COMBINATORICS
  Editors-in-chief: C. A. Athanasiadis, T. Lam, A. Munemasa, H. Van Maldeghem
ISSN 0925-9899 (print) • ISSN 1572-9192 (electronic)
 

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

Eric Swartz

DOI: 10.1007/s10801-010-0235-7

Abstract

A near-polygonal graph is a graph Γ  which has a set C \mathcal{C} of m-cycles for some positive integer m such that each 2-path of Γ  is contained in exactly one cycle in C \mathcal{C}. If m is the girth of Γ , then the graph is called polygonal. We provide a construction of an infinite family of polygonal graphs of arbitrary even girth with 2-arc transitive automorphism groups, showing that there are infinitely many 2-arc transitive polygonal graphs of every girth.

Pages: 95–109

Keywords: keywords algebraic graph theory; polygonal graph; 2-arc transitive graph

Full Text: PDF



© 1992–2009 Journal of Algebraic Combinatorics
© 2012 FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition