Tetravalent half-arc-transitive graphs of order 2pq

14Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p 2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p-1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41-76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q. © 2010 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Feng, Y. Q., Kwak, J. H., Wang, X., & Zhou, J. X. (2011). Tetravalent half-arc-transitive graphs of order 2pq. Journal of Algebraic Combinatorics, 33(4), 543–553. https://doi.org/10.1007/s10801-010-0257-1

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