Search Results for ""

An equation is said to be a closed-form solution if it solves a given problem in terms of functions and mathematical operations from a given generally-accepted set. For ...

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...

Connect-Four is a tic-tac-toe-like two-player game in which players alternately place pieces on a vertical board 7 columns across and 6 rows high. Each player uses pieces of ...

Cribbage is a game in which each of two players is dealt a hand of six cards. Each player then discards two of his six cards to a four-card "crib" which alternates between ...

Cubic nonhamiltonian graphs are nonhamiltonian graphs that are also cubic. The numbers of connected cubic nonhamiltonian graphs on n=10, 12, ... nodes are 2, 5, 35, 219, ...

A Cunningham number is a binomial number of the form C^+/-(b,n)=b^n+/-1 with b>1 and n positive integers. Bases b^k which are themselves powers need not be considered since ...

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...

A double Mersenne number is a number of the form M_(M_n)=2^(2^n-1)-1, where M_n is a Mersenne number. The first few double Mersenne numbers are 1, 7, 127, 32767, 2147483647, ...