Search Results for ""
1731 - 1740 of 2745 for Distance Regular GraphSearch Results
An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).
The problem of deciding if four colors are sufficient to color any map on a plane or sphere.
As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.
The x- (horizontal) coordinate of a point in a two dimensional coordinate system. Physicists and astronomers sometimes use the term to refer to the axis itself instead of the ...
Alpha is the name for the first letter in the Greek alphabet: alpha. In finance, alpha is a financial measure giving the difference between a fund's actual return and its ...
The angular acceleration alpha is defined as the time derivative of the angular velocity omega, alpha=(domega)/(dt)=(d^2theta)/(dt^2)z^^=(a)/r.
All triangles are bicentric, i.e., possess both an incircle and a circumcircle. This is not necessarily the case for polygons with four or more sides. The inradius r and ...
The pedal curve of the cissoid, when the pedal point is on the axis beyond the asymptote at a distance from the cusp which is four times that of the asymptote is a cardioid.
An n-dimensional closed disk of radius r is the collection of points of distance <=r from a fixed point in n-dimensional Euclidean space. Krantz (1999, p. 3) uses the symbol ...
Consider a set of points X_i on an attractor, then the correlation integral is C(l)=lim_(N->infty)1/(N^2)f, where f is the number of pairs (i,j) whose distance |X_i-X_j|<l. ...
...
View search results from all Wolfram sites (19754 matches)

