Smallest tetravalent half-arc-transitive graphs with the vertex-stabiliser isomorphic to the dihedral group of order 8

15Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A connected graph whose automorphism group acts transitively on the edges and vertices, but not on the set of ordered pairs of adjacent vertices of the graph is called half-arc-transitive. It is well known that the valence of a half-arc-transitive graph is even and at least four. Several infinite families of half-arc-transitive graphs of valence four are known, however, in all except four of the known specimens, the vertex-stabiliser in the automorphism group is abelian. The first example of a half-arc-transitive graph of valence four and with a non-abelian vertex-stabiliser was described in Conder and Marušič (2003) [4]. This example has 10752 vertices and vertex-stabiliser isomorphic to the dihedral group of order 8. In this paper, we show that no such graphs of smaller order exist, thus answering a frequently asked question.

Cite

CITATION STYLE

APA

Potočnik, P., & Požar, R. (2017). Smallest tetravalent half-arc-transitive graphs with the vertex-stabiliser isomorphic to the dihedral group of order 8. Journal of Combinatorial Theory. Series A, 145, 172–183. https://doi.org/10.1016/j.jcta.2016.04.003

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free