Search Results for ""

A n-crossed prism graph for positive even n (a term introduced here for the first time), is a graph obtained by taking two disjoint cycle graphs C_n and adding edges ...

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 ...

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) = ...

The dilogarithm Li_2(z) is a special case of the polylogarithm Li_n(z) for n=2. Note that the notation Li_2(x) is unfortunately similar to that for the logarithmic integral ...

When the elliptic modulus k has a singular value, the complete elliptic integrals may be computed in analytic form in terms of gamma functions. Abel (quoted in Whittaker and ...

An equilateral triangle is a triangle with all three sides of equal length a, corresponding to what could also be known as a "regular" triangle. An equilateral triangle is ...

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

A helix, sometimes also called a coil, is a curve for which the tangent makes a constant angle with a fixed line. The shortest path between two points on a cylinder (one not ...

An ideal is a subset I of elements in a ring R that forms an additive group and has the property that, whenever x belongs to R and y belongs to I, then xy and yx belong to I. ...

An incircle is an inscribed circle of a polygon, i.e., a circle that is tangent to each of the polygon's sides. The center I of the incircle is called the incenter, and the ...