Search Results for ""

The middle levels conjecture, also known as revolving door conjecture, posits that the middle layer graph has a Hamilton cycle for every n>=1. The conjecture was proved by ...

If the period of a repeating decimal for a/p, where p is prime and a/p is a reduced fraction, has an even number of digits, then dividing the repeating portion into halves ...

The n-roll mill curve is given by the equation x^n-(n; 2)x^(n-2)y^2+(n; 4)x^(n-4)y^4-...=a^n, where (n; k) is a binomial coefficient.

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.