Search Results for ""

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...

A polytope in four dimensions. Polychora are bounded by polyhedra.

A stereogram made of two pictures, one red and one blue, taken from offset positions. When the pictures are viewed through glasses with one lens of each color, the picture ...

A chord of a graph cycle C is an edge not in the edge set of C whose endpoints lie in the vertex set C (West 2000, p. 225). For example, in the diamond graph as labeled ...

Color each segment of a knot diagram using one of three colors. If 1. At any crossing, either the colors are all different or all the same, and 2. At least two colors are ...

Rule 182 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

Rule 250 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...

An optical illusion consisting of a spinnable top marked in black with the pattern shown above. When the wheel is spun (especially slowly), the black broken lines appear as ...