Search Results for ""

An independent edge set (also called a matching) of a graph G is a subset of the edges such that no two edges in the subset share a vertex of G (Skiena 1990, p. 219). The ...

The point of concurrence of the six planes in Monge's tetrahedron theorem.

The edge multiplicity of a given end vertex in a multigraph is the number of multiple edges sharing that end vertex. The maximum edge multiplicity in such a graph is known as ...

A global extremum, also known as an absolute extremum, is a global minimum or global maximum. It is impossible to construct an algorithm that will find a global extremum for ...

A set of maximum degree to which all other degrees of recursively enumerable sets can be many-one reduced. If set A is many-one complete, then it is one-one complete, and ...

A set of maximum degree to which all other degrees of recursively enumerable sets can be one-one reduced. If set A is many-one complete, then it is one-one complete, and vice ...

Let v(G) be the number of vertices in a graph G and h(G) the length of the maximum cycle in G. Then the shortness exponent of a class of graphs G is defined by sigma(G)=lim ...

The series of Sturm functions arising in application of the Sturm theorem.

If (1-z)^(a+b-c)_2F_1(2a,2b;2c;z)=sum_(n=0)^inftya_nz^n, then where (a)_n is a Pochhammer symbol and _2F_1(a,b;c;z) is a hypergeometric function.

Let R be a ring, let A be a subring, and let B be an ideal of R. Then A+B={a+b:a in A,b in B} is a subring of R, A intersection B is an ideal of A and (A+B)/B=A/(A ...