Search Results for ""

A connected dominating set in a connected graph G is a dominating set in G whose vertices induce a connected subgraph, i.e., one in which there is no dominating vertex not ...

The self-intersection of a one-sided surface. The word "cross-cap" is sometimes also written without the hyphen as the single word "crosscap." The cross-cap can be thought of ...

The science of breaking codes, which is one part of cryptology.

Attractive compounds can be constructed from the cube 3-compounds and their octahedron 3-compound duals. One is illustrated above. This compound will be implemented in a ...

A cubic equation is an equation involving a cubic polynomial, i.e., one of the form a_3x^3+a_2x^2+a_1x+a_0=0. Since a_3!=0 (or else the polynomial would be quadratic and not ...

An equation of the form y=ax^3+bx^2+cx+d where only one root is real.

One of the Plücker characteristics, defined by p=1/2(n-1)(n-2)-(delta+kappa)=1/2(m-1)(m-2)-(tau+iota), where m is the class, n the order, delta the number of nodes, kappa the ...

The catacaustic of one arch of a cycloid given parametrically as x = t-sint (1) y = 1-cost (2) is a complicated expression for an arbitrary radiant point. For the case of the ...

The cylindrical parts of a system of real algebraic equations and inequalities in variables {x_1,...,x_n} are the terms f_1 <= x_1<=g_1 (1) f_2(x_1) <= x_2<=g_2(x_1) (2) | ...

For every partition of all the points on a line into two nonempty sets such that no point of either lies between two points of the other, there is a point of one set which ...