Search Results for ""

A graph for which the relations between pairs of vertices are symmetric, so that each edge has no directional character (as opposed to a directed graph). Unless otherwise ...

A number of the form aba..., abab..., etc. The first few nontrivial undulants (with the stipulation that a!=b) are 101, 121, 131, 141, 151, 161, 171, 181, 191, 202, 212, ... ...

An unduloid, also called an onduloid, is a surface of revolution with constant nonzero mean curvature. It is a roulette obtained from the path described by the foci of a ...

Two quantities a and b which are not equal are said to be unequal, and this relationship can be denoted a!=b.

A paradox also known as the surprise examination paradox or prediction paradox. A prisoner is told that he will be hanged on some day between Monday and Friday, but that he ...

A game in which a certain player can always win when he plays properly. All categorical games are unfair (Steinhaus 1999, p. 16), as is the game of Marienbad.

An unfolding is the cutting along edges and flattening out of a polyhedron to form a net. Determining how to unfold a polyhedron into a net is tricky. For example, cuts ...

An ungraceful graph is a simple graph that does not possess a graceful labeling, i.e., a graph that is not a graceful graph (Gardner 1972). Such graphs have also been termed ...

An ungula is a portion of a solid of revolution obtained by cutting via a plane oblique to its base. The term derives from the Latin word ungula for the hoof of a horse. ...

An unhappy number is a number that is not happy, i.e., a number n such that iterating this sum-of-squared-digits map starting with n never reaches the number 1. The first few ...