On quartic half-arc-transitive metacirculants

Abstract

Following Alspach and Parsons, a metacirculant graph is a graph admitting a transitive group generated by two automorphisms and σ, where is (m,n)-semiregular for some integers m ≥ 1, n ≥ 2, and where σ normalizes , cyclically permuting the orbits of in such a way that σm has at least one fixed vertex. A 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…