Search Results for ""
1911 - 1920 of 2823 for Unit distance graphSearch Results
The group algebra K[G], where K is a field and G a group with the operation *, is the set of all linear combinations of finitely many elements of G with coefficients in K, ...
A regular number, also called a finite decimal (Havil 2003, p. 25), is a positive number that has a finite decimal expansion. A number such as 1/3=0.33333... which is not ...
In category theory, a tensor category (C, tensor ,I,a,r,l) consists of a category C, an object I of C, a functor tensor :C×C->C, and a natural isomorphism a = a_(UVW):(U ...
Given a topological vector space X and a neighborhood V of 0 in X, the polar K=K(V) of V is defined to be the set K(V)={Lambda in X^*:|Lambdax|<=1 for every x in V} and where ...
Trigonometry
The Earth-Moon problem is a special case of the empire problem for countries with m=2 disjoint regions, with one region of each country lying on the Earth and one on the Moon ...
A generalization of Turán's theorem to non-complete graphs.
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 ...
This problem is NP-complete (Garey and Johnson 1983).
The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...
...
View search results from all Wolfram sites (22301 matches)

