Search Results for ""

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.

The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.

A matrix is ill-conditioned if the condition number is too large (and singular if it is infinite).

The number of inward directed graph edges from a given graph vertex in a directed graph.

Given a convex plane region with area A and perimeter p, then |N-A|<p, where N is the number of enclosed lattice points.

If a real algebraic curve has no singularities except nodes and cusps, bitangents, and inflection points, then n+2tau_2^'+iota^'=m+2delta_2^'+kappa^', where n is the order, ...

A family of subsets of a topological space such that every point has a neighborhood which intersects only a finite number of them.

The number of outward directed graph edges from a given graph vertex in a directed graph.

The polynomial giving the number of colorings with m colors of a structure defined by a permutation group.

The number of digits used to perform a given computation. The concepts of accuracy and precision are both closely related and often confused. While the accuracy of a number x ...