Search Results for ""

An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n=1, 2, ...

A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...

A linkage invented in 1630 by Christoph Scheiner for making a scaled copy of a given figure. The linkage is pivoted at O; hinges are denoted circledot . By placing a pencil ...

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...

A perfect ruler also called a complete ruler, is type of ruler considered by Guy (1994) which has k distinct marks spaced such that the distances between marks can be used to ...

A graphical plot with abscissa given by the number p of consecutive numbers constituting a single period and ordinate given by the correlation ratio eta. The equation of the ...

Polynomials s_k(x;lambda,mu) which are a generalization of the Boole polynomials, form the Sheffer sequence for g(t) = (1+e^(lambdat))^mu (1) f(t) = e^t-1 (2) and have ...

Plancherel's theorem states that the integral of the squared modulus of a function is equal to the integral of the squared modulus of its spectrum. It corresponds to ...

Given an obtuse triangle, the polar circle has center at the orthocenter H. Call H_i the feet. Then the square of the radius r is given by r^2 = HA^_·HH_A^_ (1) = HB^_·HH_B^_ ...

The diagonal of a polyhedron is any line segment connecting two nonadjacent vertices of the polyhedron. Any polyhedron having no diagonals must have a skeleton which is a ...