Search Results for ""
5811 - 5820 of 13135 for Computational GeometrySearch Results
A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.
A set whose members index (label) members of another set. For example, in the set A= union _(k in K)A_k, the set K is an index set of the set A.
One of the basic objects treated in a given formal language system. The term is sometimes also used as a synonym for urelement.
An induced subgraph is a subgraph obtained from an original graph by removing a subset of vertices and/or edges together with any edges whose endpoints are both in this ...
The use of the principle of mathematical induction in a proof. Induction used in mathematics is often called mathematical induction.
An infinitesimal which is not the differential of an actual function and which cannot be expressed as dz=((partialz)/(partialx))_ydx+((partialz)/(partialy))_xdy, the way an ...
Let sigma_infty(n) be the sum of the infinitary divisors of a number n. An infinitary k-multiperfect number is a number n such that sigma_infty(n)=kn. Cohen (1990) found 13 ...
Greater than any assignable quantity of the sort in question. In mathematics, the concept of the infinite is made more precise through the notion of an infinite set.
A graph that is not finite is called infinite.
An infinitesimal is some quantity that is explicitly nonzero and yet smaller in absolute value than any real quantity. The understanding of infinitesimals was a major ...
...
View search results from all Wolfram sites (173967 matches)

