Search Results for ""

The fractal illustrated above.

A general formula giving the number of distinct ways of folding an m×n rectangular map is not known. A distinct folding is defined as a permutation of N=m×n numbered cells ...

Formulas obtained from differentiating Newton's forward difference formula, where R_n^'=h^nf^((n+1))(xi)d/(dp)(p; n+1)+h^(n+1)(p; n+1)d/(dx)f^((n+1))(xi), (n; k) is a ...

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...

The proposition that every proper ideal of a Boolean algebra can be extended to a maximal ideal. It is equivalent to the Boolean representation theorem, which can be proved ...

A maximal independent edge set of a graph is an independent edge set that cannot be expanded to another independent edge set by addition of any edge in the graph. Note that a ...

A maximal irredundant set is an irredundant set that cannot be expanded to another irredundant set by addition of any vertex in the graph. Note that a maximal irredundant set ...

A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...

This problem is NP-complete (Garey and Johnson 1983).

A subset E of a topological space S is said to be meager if E is of first category in S, i.e., if E can be written as the countable union of subsets which are nowhere dense ...