Search Results for ""

Spherical coordinates, also called spherical polar coordinates (Walton 1967, Arfken 1985), are a system of curvilinear coordinates that are natural for describing positions ...

Cartesian coordinates are rectilinear two- or three-dimensional coordinates (and therefore a special case of curvilinear coordinates) which are also called rectangular ...

The confocal ellipsoidal coordinates, called simply "ellipsoidal coordinates" by Morse and Feshbach (1953) and "elliptic coordinates" by Hilbert and Cohn-Vossen (1999, p. ...

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...

The score sequence of a tournament is a monotonic nondecreasing sequence of the outdegrees of the graph vertices of the corresponding tournament graph. Elements of a score ...

The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...

The thickness (or depth) t(G) (Skiena 1990, p. 251; Beineke 1997) or theta(G) (Harary 1994, p. 120) of a graph G is the minimum number of planar edge-induced subgraphs P_i of ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

A magic square is a square array of numbers consisting of the distinct positive integers 1, 2, ..., n^2 arranged such that the sum of the n numbers in any horizontal, ...