Search Results for ""

The disdyakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis dodecahedron. It is implemented in the Wolfram Language as ...

The disdyakis triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

The Foster cage is one of the four (5,5)-cage graphs. Like the other (5,5)-cages, the Foster cage has 30 nodes. It has 75 edges, diameter 3, girth 5, chromatic number 4, and ...

The Galton board, also known as a quincunx or bean machine, is a device for statistical experiments named after English scientist Sir Francis Galton. It consists of an ...

A generalized dodecagon is a generalized polygon of order 12. GD(1,2) is the (3,12)-cage graph, more commonly known as the Tutte 12-cage. GD(2,1) is the line graph of the ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...

The goat problem (or bull-tethering problem) considers a fenced circular field of radius a with a goat (or bull, or other animal) tied to a point on the interior or exterior ...

The Hilbert curve is a Lindenmayer system invented by Hilbert (1891) whose limit is a plane-filling function which fills a square. Traversing the polyhedron vertices of an ...

The m×n king graph is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a king. The number ...