triangular edges. Coxeter named it a Möbius–Kantor polygon for sharing the complex configuration structure as the Möbius–Kantor configuration, (83). Discovered...

the complex polygon 3{3}3. Coxeter named it a Möbius–Kantor polygon. More abstractly, the Möbius–Kantor configuration can be described as a system of...

the Möbius–Kantor graph is a symmetric bipartite cubic graph with 16 vertices and 24 edges named after August Ferdinand Möbius and Seligmann Kantor. It...

16-cell can be seen as its dual, a 4-4 duopyramid. The Möbius–Kantor polygon is a regular complex polygon 3{3}3, , in C 2 {\displaystyle \mathbb {C} ^{2}} shares...

hyperplanes of symmetry passing through the center yield complex 3{4}3 Möbius–Kantor polygons. The root vectors of simple Lie group E8 are represented by the...

through that point (but not the other points on them) produces the (83) Möbius–Kantor configuration. Given an integer α ≥ 1, a tactical configuration satisfying:...

In geometry, a regular complex polygon is a generalization of a regular polygon in real space to an analogous structure in a complex Hilbert space, where...

configuration, (123 94), points indexed 1...12 can have configuration table: Möbius–Kantor configuration Removing any one point and its four incident lines from...

polygon is a truncation of a regular polygon. A quasiregular polygon contains alternate edges of the regular polygons and . The quasiregular polygon has...

geometry, but cannot be constructed in the Euclidean plane. (83), the Möbius–Kantor configuration. This configuration describes two quadrilaterals that...

Petersen graphs are the n-prism G(n, 1), the Dürer graph G(6, 2), the Möbius-Kantor graph G(8, 3), the dodecahedron G(10, 2), the Desargues graph G(10,...

strongly regular graph is symmetric, but not vice versa. Heawood graph Möbius–Kantor graph Pappus graph Desargues graph Nauru graph Coxeter graph Tutte–Coxeter...

{\displaystyle G(n,1)} the Dürer graph G ( 6 , 2 ) {\displaystyle G(6,2)} , the Möbius-Kantor graph G ( 8 , 3 ) {\displaystyle G(8,3)} , the dodecahedron G ( 10 ...

graphs are the cubical graph G(4, 1), the Petersen graph G(5, 2), the Möbius–Kantor graph G(8, 3), the dodecahedral graph G(10, 2) and the Nauru graph G(12...

by connecting an outer polygon and an inner star with the same number of points; for instance, this applies to the Möbius–Kantor graph and the Desargues...

^{3}} contains 72 regular complex triangular edges, as well as 27 polygonal Möbius–Kantor faces and 27 vertices. It is notable for being the vertex figure...

unit distance graphs). All generalized Petersen graphs, such as the Möbius–Kantor graph depicted, are non-strict unit distance graphs. Matchstick graphs...

G(4,1)} , the Petersen graph G ( 5 , 2 ) {\displaystyle G(5,2)} , the Möbius–Kantor graph G ( 8 , 3 ) {\displaystyle G(8,3)} , the dodecahedral graph G...