An algebraic characterization of finite symmetric tournaments

DOI10.1017/S0004972700044257zbMath0222.05109OpenAlexW2077287268MaRDI QIDQ5626695

J. Lennart Berggren

Publication date: 1972

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700044257

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Even tournaments and Hadamard tournaments ⋮ On graph norms for complex‐valued functions ⋮ Paley and the Paley Graphs ⋮ \((-2)\)-monohemimorphic graphs ⋮ Tournaments with given (infinite) automorphism group ⋮ -TRANSITIVE DIGRAPHS PRESERVING A CARTESIAN DECOMPOSITION ⋮ \(k\)-spectrally monomorphic tournaments

Cites Work

• Unnamed Item
• Solvability of groups of odd order
• The Group of the Quadratic Residue Tournament
• Endliche Gruppen I

This page was built for publication: An algebraic characterization of finite symmetric tournaments