English

On quartic half-arc-transitive metacirculants

Combinatorics 2007-05-23 v1

Abstract

Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms ρ\rho and σ\sigma, where ρ\rho is (m,n)(m,n)-semiregular for some integers m1m \geq 1, n2n \geq 2, and where σ\sigma normalizes ρ\rho, cyclically permuting the orbits of ρ\rho in such a way that σm\sigma^m has at least one fixed vertex. A {\em half-arc-transitive graph} is a vertex- and edge- but not arc-transitive graph. In this article quartic half-arc-transitive metacirculants are explored and their connection to the so called tightly attached quartic half-arc-transitive graphs is explored. It is shown that there are three essentially different possibilities for a quartic half-arc-transitive metacirculant which is not tightly attached to exist. These graphs are extensively studied and some infinite families of such graphs are constructed.

Keywords

Cite

@article{arxiv.math/0702183,
  title  = {On quartic half-arc-transitive metacirculants},
  author = {Dragan Marusic and Primoz Sparl},
  journal= {arXiv preprint arXiv:math/0702183},
  year   = {2007}
}

Comments

31 pages, 2 figures