Search Results for ""

For a catastrophically unstable recurrence in one direction, any seed values for consecutive x_j and x_(j+1) will converge to the desired sequence of functions in the ...

A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...

Given a collection of sets, a member set that is not a proper subset of another member set is called a minimal set. Minimal sets are important in graph theory, since many ...

A minimum clique covering is a clique covering of minimum size, and the size of such a minimum clique covering is known as the clique covering number. Note that while a ...

A minimum dominating set is a dominating set of smallest size in a given graph. The size of a minimum dominating set is known as the domination number of the graph. A minimum ...

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.