Search Results for ""

The depth of a vertex v in a rooted tree as the number of edges from v to the root vertex. A function to return the depth of a vertex v in a tree g may be implemented in a ...

The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...

Solution of a system of second-order homogeneous ordinary differential equations with constant coefficients of the form (d^2x)/(dt^2)+bx=0, where b is a positive definite ...

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.

A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

Given a succession of nonsingular points which are on a nonhyperelliptic curve of curve genus p, but are not a group of the canonical series, the number of groups of the ...

The entire function phi(rho,beta;z)=sum_(k=0)^infty(z^k)/(k!Gamma(rhok+beta)), where rho>-1 and beta in C, named after the British mathematician E. M. Wright.

The Yiu triangle DeltaO_AO_BO_C is the triangle formed by the centers of the Yiu circles. It has area where f(a,b,c) is a 12th-order polynomial and Delta is the area of the ...

A zero vector, denoted 0, is a vector of length 0, and thus has all components equal to zero. It is the additive identity of the additive group of vectors.

The letter O is used for a number of different purposes in mathematics. The double-struck O is sometimes used to represent octonions. The symbols O(x) (sometimes called the ...