Abstract
A tournament T is called symmetric if its automorphism group is transitive on the points and arcs of T. The main result of this paper is that if T is a finite symmetric tournament then T is isomorphic to one of the quadratic residue tournaments formed on the points of a finite field GF(pn), pn ≡ 3 (4), by the following rule: If a, b ∈ GF(pn) then there is an are directed from a to b exactly when b – a is a non-zero quadratic residue in GF(pn).
Publisher
Cambridge University Press (CUP)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On graph norms for complex‐valued functions;Journal of the London Mathematical Society;2022-05-23
2. k-Spectrally monomorphic tournaments;Discrete Mathematics;2022-05
3. Paley and the Paley Graphs;Springer Proceedings in Mathematics & Statistics;2020
4. -TRANSITIVE DIGRAPHS PRESERVING A CARTESIAN DECOMPOSITION;Journal of the Australian Mathematical Society;2015-03-31
5. Les graphes (−2)-monohémimorphes;Comptes Rendus Mathematique;2012-08