Search Results for ""

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

Let P(z) and Q(z) be univariate polynomials in a complex variable z, and let the polynomial degrees of P and Q satisfy deg(Q)>=deg(P+2). Then int_gamma(P(z))/(Q(z))dz = ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

A graphoid consists of a set M of elements together with two collections C and D of nonempty subsets of M, called circuits and cocircuits respectively, such that 1. For any C ...

If G is a group, then the torsion elements Tor(G) of G (also called the torsion of G) are defined to be the set of elements g in G such that g^n=e for some natural number n, ...

Define T as the set of all points t with probabilities P(x) such that a>t=>P(a<=x<=a+da)<P_0 or a<t=>P(a<=x<=a+da)<P_0, where P_0 is a point probability (often, the ...

Given a ring R with identity, the special linear group SL_n(R) is the group of n×n matrices with elements in R and determinant 1. The special linear group SL_n(q), where q is ...

A complete k-partite graph is a k-partite graph (i.e., a set of graph vertices decomposed into k disjoint sets such that no two graph vertices within the same set are ...

An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...

An Ore graph is a graph that satisfies Ore's theorem, i.e., a graph G for which the sums of the degrees of nonadjacent vertices is greater than or equal to the number of ...