Search Results for ""

A complete tripartite graph is the k=3 case of a complete k-partite graph. In other words, it is a tripartite graph (i.e., a set of graph vertices decomposed into three ...

A (finite, circular) conical surface is a ruled surface created by fixing one end of a line segment at a point (known as the vertex or apex of the cone) and sweeping the ...

The conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...

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 cross graph is the 6-vertex tree illustrated above. It is implemented in the Wolfram Language as GraphData["CrossGraph"].

There are three types of cubic lattices corresponding to three types of cubic close packing, as summarized in the following table. Now that the Kepler conjecture has been ...

A cubic semisymmetric graph is a graph that is both cubic (i.e., regular of degree 3) and semisymmetric (i.e., edge- but not vertex-transitive). The four smallest cubic ...

A cyclic quadrilateral is a quadrilateral for which a circle can be circumscribed so that it touches each polygon vertex. A quadrilateral that can be both inscribed and ...

Define a cell in R^1 as an open interval or a point. A cell in R^(k+1) then has one of two forms, {(x,y):x in C, and f(x)<y<g(x)} (1) or {(x,y):x in C, and y=f(x)}, (2) where ...

Dawson's integral (Abramowitz and Stegun 1972, pp. 295 and 319), also sometimes called Dawson's function, is the entire function given by the integral F(x) = ...