Search Results for ""

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

The parameter r (sometimes also denoted mu) in the logistic equation x_(n+1)=rx_n(1-x_n).

A ring is commutative if the multiplication operation is commutative.

x^(2n)+1=[x^2-2xcos(pi/(2n))+1] ×[x^2-2xcos((3pi)/(2n))+1]×...× ×[x^2-2xcos(((2n-1)pi)/(2n))+1].

The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...

A function used to study ordinary differential equations.

A minimization of the maximum error for a fixed number of terms.

A 5-polyabolo.

The locus of lines meeting three given skew lines. ("Regulus" is also the name of the brightest star in the constellation Leo.)

The value at a stationary point.