Construction of a class of loops via graphs.
From MaRDI portal
Publication:2380490
DOI10.1007/s00022-009-0020-8zbMath1198.20064OpenAlexW2025983485MaRDI QIDQ2380490
Publication date: 26 March 2010
Published in: Journal of Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00022-009-0020-8
Abelian groupsBruck loopscolored graphsinvolutorial difference loopsK-loopsBol loopsregular involution setsID-loops
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Loops, quasigroups (20N05) Linear incidence geometric structures with parallelism (51A15)
Related Items
Loops with two-sided inverses constructed by a class of regular permutation sets. ⋮ Slid product of loops: a generalization.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Groups with an involutory antiautomorphism and \(K\)-loops; application to space-time-world and hyperbolic geometry. I
- Polar graphs and corresponding involution sets, loops and Steiner triple systems.
- On \(K\)-loops of finite order
- Loops, reflection structures and graphs with parallelism.
- Connections between loops of exponent 2, reflection structures and complete graphs with parallelism
- Theory of K-loops
- Left loops, bipartite graphs with parallelism and bipartite involution sets.
- One-factorizations of the complete graph—A survey
- Finite Bol loops
- Inner mappings of Bruck loops