Search Results for ""

The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...

The Miquel configuration is the 6_4 configuration illustrated above. Its Levi graph is the rhombic dodecahedral graph.

A fractal based on iterating the map F(x)=ax+(2(1-a)x^2)/(1+x^2) (1) according to x_(n+1) = by_n+F(x_n) (2) x_(y+1) = -x_n+F(x_(n+1)). (3) The plots above show 10^4 ...

A version of nim-like games in which the player taking the last piece is the loser. For most impartial games, this form is much harder to analyze, but it requires only a ...

A quartic surface named after its resemblance to the liturgical headdress worn by bishops and given by the equation 4x^2(x^2+y^2+z^2)-y^2(1-y^2-z^2)=0.

A mixed graph in which both directed and undirected edges may exist. If only directed edges exist, the graph is called a directed graph. If only undirected edges exist, it is ...

A collection of moves together with a corresponding set of weights which are followed probabilistically in the playing of a game. The minimax theorem of game theory states ...

A phenomenon in which a system being forced at an irrational period undergoes rational, periodic motion which persists for a finite range of forcing values. It may occur for ...

A well-formed formula B is said to be true for the interpretation M (written |=_MB) iff every sequence in Sigma (the set of all denumerable sequences of elements of the ...

A lattice which satisfies the identity (x ^ y) v (x ^ z)=x ^ (y v (x ^ z)) is said to be modular.