TOPICS
Search

Search Results for ""


1981 - 1990 of 4167 for Line GraphSearch Results
Chess is a two-player board game believed to have been played in India as early as the sixth century AD. In different parts of this world, different chess games are played. ...
Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...
The radical circle of the Stammler circles has center at the nine-point center N, which is Kimberling center X_5. The radius is given by R_S = sqrt(R^2+ON^2) (1) = ...
A tree which is not rooted, i.e., a normal tree with no node singled out for special treatment (Skiena 1990, p. 107). Free trees are sometimes known instead as unrooted trees ...
Martin Gardner (1975) played an April Fool's joke by asserting that the map of 110 regions illustrated above (left figure) required five colors and constitutes a ...
Lines that intersect in a point are called intersecting lines. Lines that do not intersect are called parallel lines in the plane, and either parallel or skew lines in ...
Lachlan's term for a set of four lines, no three of which are concurrent.
The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...
Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...
A phenomenological law also called the first digit law, first digit phenomenon, or leading digit phenomenon. Benford's law states that in listings, tables of statistics, ...
1 ... 196|197|198|199|200|201|202 ... 417 Previous Next

...