We characterize the class of self-complementary vertex-transitive digraphs on a prime number p of vertices. Using this, we enumerate (i) self-complementary strongly vertex-transitive digraphs on p vertices, (ii) self-complementary vertex-transitive digraphs on p vertices, (iii) selfcomplementary ver
Permutation Groups, Vertex-transitive Digraphs and Semiregular Automorphisms
✍ Scribed by D. Maru s̆c̆; R. Scapellato
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 120 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
✦ Synopsis
A nonidentity element of a permutation group is said to be semiregular if all of its orbits have the same length. The work in this paper is linked to [6] where the problem of existence of semiregular automorphisms in vertex-transitive digraphs was posed. It was observed there that every vertextransitive digraph of order p k or mp, where p is a prime, k ≥ 1 and m ≤ p are positive integers, has a semiregular automorphism. On the other hand, there are transitive permutation groups without semiregular elements [4]. In this paper, it is proved that every cubic vertex-transitive graph contains a semiregular automorphism, and moreover, it is shown that every vertex-transitive digraph of order 2 p 2 , where p is a prime, contains a semiregular automorphism.
📜 SIMILAR VOLUMES
The main result of this paper is that vertex-transitive graphs and digraphs of order p 4 are Hamiltonian, where p is a prime number. 1998 Academic Press 1. INTRODUCTION Witte [7] proved that Cayley digraphs of finite p-groups are Hamiltonian. In [2], Marus$ ic$ showed that all vertex-transitive digr
We characterize the point stabilizers and kernels of finitary permutation representations of infinite transitive groups of finitary permutations. Moreover, the number of such representations is determined.
y1 isometry of L. A set of generators and the full automorphism group of V q are L determined.
## Abstract Motivated by symmetric association schemes (which are known to approximate generously unitransitive group actions), we formulate combinatorial approximations to transitive extensions of generously unitransitive permutation groups. Specifically, the notions of compatible and coherent par
point sub-VOA, V G , was studied previously by the authors, who found a set of Ž generators and determined the automorphism group when G is cyclic from the . Ž . '' A-series'' or dihedral from the ''D-series'' . In the present article, we obtain analogous results for the remaining possibilities for