field of graph theory, 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...

Look up Möbius in Wiktionary, the free dictionary. Moebius, Mœbius, Möbius or Mobius may refer to: August Ferdinand Möbius (1790–1868), German mathematician...

In geometry, the Möbius–Kantor configuration is a configuration consisting of eight points and eight lines, with three points on each line and three lines...

Leipzig. Möbius died in Leipzig in 1868 at the age of 77. His son Theodor was a noted philologist. He is best known for his discovery of the Möbius strip...

Petersen graphs also include the n-prism G ( n , 1 ) {\displaystyle G(n,1)} the Dürer graph G ( 6 , 2 ) {\displaystyle G(6,2)} , the Möbius-Kantor graph G (...

Heawood graph is the Levi graph of the Fano plane. It is also known as the (3,6)-cage, and is 3-regular with 14 vertices. The Möbius–Kantor graph is the...

spindle and Golomb graph (small 4-chromatic unit distance graphs). All generalized Petersen graphs, such as the Möbius–Kantor graph depicted, are non-strict...

Austro-Hungarian Empire. He is known for the Möbius–Kantor configuration and the Möbius-Kantor graph. Kantor studied mathematics and physics at the Technische...

the Möbius–Kantor graph, for example, has crossing number 4 and is toroidal. Any toroidal graph has chromatic number at most 7. The complete graph K7 provides...

individual graphs are cubic and symmetric, including the utility graph, the Petersen graph, the Heawood graph, the Möbius–Kantor graph, the Pappus graph, the...

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

In geometry, the Möbius–Kantor polygon is a regular complex polygon 3{3}3, , in C 2 {\displaystyle \mathbb {C} ^{2}} . 3{3}3 has 8 vertices, and 8 edges...

In geometry, the Möbius configuration or Möbius tetrads is a certain configuration in Euclidean space or projective space, consisting of two tetrahedra...

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, 3)...

In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of...

smallest 4-crossing cubic graph is the Möbius-Kantor graph, with 16 vertices. The smallest 5-crossing cubic graph is the Pappus graph, with 18 vertices. The...

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 ( 10 , 2 )...

the Möbius–Kantor graph G(8, 3), the dodecahedral graph G(10, 2) and the Nauru graph G(12, 5). The characteristic polynomial of the Desargues graph is...

The Möbius–Kantor graph, the Cayley graph of the Pauli group G 1 {\displaystyle G_{1}} with generators X, Y, and Z...

graph formed 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...

Möbius–Kantor configuration is the unique (83). Each incidence structure C corresponds to a bipartite graph called the Levi graph or incidence graph of...

various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...

1934 Seifert, Threlfall: Variationsrechnung im Großen, Teubner 1938 Möbius–Kantor graph Schwarz triangle tessellation Gabriele Dörflinger: William R. M....

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 the mathematical field of graph theory, LCF notation or LCF code is a notation devised by Joshua Lederberg, and extended by H. S. M. Coxeter and Robert...

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

of the graph. Finite Groups of Automorphisms, Cambridge University Press (1971) Algebraic Graph Theory, Cambridge University Press (1974) Graph Theory...

Hesse configuration produces another configuration of type 8383, the Möbius–Kantor configuration. In the Hesse configuration, the 12 lines may be grouped...

duoprism, the 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...

Surveys the major and minor vector systems of the 19th century (Hamilton, Möbius, Bellavitis, Clifford, Grassmann, Tait, Peirce, Maxwell, Macfarlane, MacAuley...