Search Results for ""

A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...

A closed interval is an interval that includes all of its limit points. If the endpoints of the interval are finite numbers a and b, then the interval {x:a<=x<=b} is denoted ...

A multiplicative factor (usually indexed) such as one of the constants a_i in the polynomial a_nx^n+a_(n-1)x^(n-1)+...+a_2x^2+a_1x+a_0. In this polynomial, the monomials are ...

A transformation of the plane which transforms collinear points into collinear points. A projective collineation transforms every one-dimensional form projectively, and a ...

The comass of a differential p-form phi is the largest value of phi on a p vector of p-volume one, sup_(v in ^ ^pTM,|v|=1)|phi(v)|.

The components of the gradient of the one-form dA are denoted A_(,k), or sometimes partial_kA, and are given by A_(,k)=(partialA)/(partialx^k) (Misner et al. 1973, p. 62). ...

A concave polygon is a polygon that is not convex. A simple polygon is concave iff at least one of its internal angles is greater than 180 degrees. An example of a non-simple ...

A topological structure which interpolates between contact structures and codimension-one foliations.

An equation of the form f(x)=b (mod m), (1) where the values of 0<=x<m for which the equation holds are sought. Such an equation may have none, one, or many solutions. There ...

A connected dominating set in a connected graph G is a dominating set in G whose vertices induce a connected subgraph, i.e., one in which there is no dominating vertex not ...