Search Results for ""

A zebra graph is a graph formed by all possible moves of a hypothetical chess piece called a "zebra" which moves analogously to a knight except that it is restricted to moves ...

Topology

De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...

The cubitruncated cuboctahedral graph is the skeleton of the cubitruncated cuboctahedron, which is the only uniform polyhedron for which this is the case. It is illustrated ...

The cuboctahedron, also called the heptaparallelohedron or dymaxion (the latter according to Buckminster Fuller; Rawles 1997), is the Archimedean solid with faces 8{3}+6{4}. ...

The Danzer graph is the Levi graph of the Danzer configuration (Boben et al. 2015). It has 70 vertices and 140 edges and is quartic, bipartite, self-dual, and unit-distance. ...

A die (plural "dice") is a solid with markings on each of its faces. The faces are usually all the same shape, making Platonic solids and Archimedean duals the obvious ...

The ditrigonal icosidodecahedral graph is the skeleton of the cube 5-compound, ditrigonal dodecadodecahedron, great ditrigonalIcosidodecahedron, and small ditrigonal ...

Simply stated, floating-point arithmetic is arithmetic performed on floating-point representations by any number of automated devices. Traditionally, this definition is ...

Generally speaking, a Green's function is an integral kernel that can be used to solve differential equations from a large number of families including simpler examples such ...