Search Results for ""

A 15_3 configuration of 15 lines and 15 points, with three lines through three points, three points on every line, and containing no triangles. It is illustrated above in two ...

The unique 8_3 configuration. It is transitive and self-dual, but cannot be realized in the real projective plane. Its Levi graph is the Möbius-Kantor graph.

WireWorld is a two-dimensional four-color cellular automaton introduced by Brian Silverman in 1987. The rule for the automaton uses the cell's old value a together with the ...

An identity graph, sometimes also known as an asymmetric graph or rigid graph (Albertson and Collins 1996), is a graph possessing a single graph automorphism. The numbers of ...

Let (P,B) denote a configuration with v points P={p_1,...,p_v} and b lines ("blocks") B=(B_1,...,B_b). Then the Levi graph L(P,B), also called the incidence graph, of a ...

The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...

Consider a finite collection of points p=(p_1,...,p_n), p_i in R^d Euclidean space (known as a configuration) and a graph G whose graph vertices correspond to pairs of points ...

The oriented matroid of a finite configuration of points extracts relative position and orientation information from the configuration. An oriented matroid can be described ...

The Delta-variation is a variation in which the varied path over which an integral is evaluated may end at different times than the correct path, and there may be variation ...

Kobon Fujimura asked for the largest number N(n) of nonoverlapping triangles that can be constructed using n lines (Gardner 1983, p. 170). A Kobon triangle is therefore ...