Search Results for ""

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

The Goddard-Henning graph, illustrated above in several embeddings, is the 9-node planar graph of graph diameter 2 having domination number gamma=3. It was first constructed ...

The harmonic parameter of a polyhedron is the weighted mean of the distances d_i from a fixed interior point to the faces, where the weights are the areas A_i of the faces, ...

The Heesch number of a closed plane figure is the maximum number of times that figure can be completely surrounded by copies of itself. The determination of the maximum ...

There are a number of tilings of various shapes by all the 12 order n=6 polyiamonds, summarized in the following table. Several of these (starred in the table below) are also ...

The meeting point of lines that connect corresponding points from homothetic figures. In the above figure, O is the homothetic center of the homothetic figures ABCDE and ...

A non-Euclidean geometry, also called Lobachevsky-Bolyai-Gauss geometry, having constant sectional curvature -1. This geometry satisfies all of Euclid's postulates except the ...

The impossible fork (Seckel 2002, p. 151), also known as the devil's pitchfork (Singmaster), blivet, or poiuyt, is a classic impossible figure originally due to Schuster ...

Isomorphic factorization colors the edges a given graph G with k colors so that the colored subgraphs are isomorphic. The graph G is then k-splittable, with k as the divisor, ...

The 60 Pascal lines of a hexagon inscribed in a conic intersect three at a time through 20 Steiner points, and also three at a time in 60 points known as Kirkman points. Each ...