Search Results for ""

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

The procedure used in subtraction to "borrow" 10 from the next higher digit column in order to obtain a positive difference in the column in question.

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 ...

The Platonic solids, also called the regular solids or regular polyhedra, are convex polyhedra with equivalent faces composed of congruent convex regular polygons. There are ...

Differential calculus is that portion of "the" calculus dealing with derivatives. Among his many other talents, Major General Stanley in Gilbert and Sullivan's operetta the ...

One of the operations of addition, subtraction, multiplication, division, and integer (or rational) root extraction.

A formula for the generalized Catalan number _pd_(qi). The general formula is (n-q; k-1)=sum_(i=1)^k_pd_(qi)(n-pi; k-i), where (n; k) is a binomial coefficient, although ...

The least number of crossings that occur in any projection of a link. In general, it is difficult to find the crossing number of a given link. Knots and links are generally ...

One of the operations exists exists (called the existential quantifier) or for all forall (called the universal quantifier, or sometimes, the general quantifier). However, ...