Search Results for ""
1281 - 1290 of 2823 for Unit distance graphSearch Results
Select three points at random on the circumference of a unit circle and find the distribution of areas of the resulting triangles determined by these three points. The first ...
A cylindrical projection of points on a unit sphere centered at O consists of extending the line OS for each point S until it intersects a cylinder tangent to the sphere at ...
Deck transformations, also called covering transformations, are defined for any cover p:A->X. They act on A by homeomorphisms which preserve the projection p. Deck ...
The dot product can be defined for two vectors X and Y by X·Y=|X||Y|costheta, (1) where theta is the angle between the vectors and |X| is the norm. It follows immediately ...
An evolute is the locus of centers of curvature (the envelope) of a plane curve's normals. The original curve is then said to be the involute of its evolute. Given a plane ...
Let lambda be (possibly complex) eigenvalues of a set of random n×n real matrices with entries independent and taken from a standard normal distribution. Then as n->infty, ...
An operation on rings and modules. Given a commutative unit ring R, and a subset S of R, closed under multiplication, such that 1 in S, and 0 not in S, the localization of R ...
The extension ring obtained from a commutative unit ring (other than the trivial ring) when allowing division by all non-zero divisors. The ring of fractions of an integral ...
A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...
Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...
...
View search results from all Wolfram sites (22301 matches)

