Search Results for ""
1611 - 1620 of 2674 for Distance Between PointsSearch Results
In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...
The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...
The Shrikhande graph is a strongly regular graph on 16 nodes. It is cospectral with the rook graph L_(4,4), so neither of the two is determined by spectrum. The Shrikhande ...
A plane quartic curve also called the cross curve or policeman on point duty curve (Cundy and Rollett 1989). It is given by the implicit equation x^2y^2-b^2x^2-a^2y^2=0, (1) ...
The Barth decic is a decic surface in complex three-dimensional projective space having the maximum possible number of ordinary double points, namely 345. It is given by the ...
Endraß surfaces are a pair of octic surfaces which have 168 ordinary double points. This is the maximum number known to exist for an octic surface, although the rigorous ...
Given collinear points W, X, Y, and Z, Y and Z are harmonic conjugates with respect to W and X if (|WY|)/(|YX|)=(|WZ|)/(|XZ|). (1) W and X are also harmonic conjugates with ...
Jung's theorem states that the generalized diameter D of a compact set X in R^n satisfies D>=Rsqrt((2(n+1))/n), where R is the circumradius of X (Danzer et al. 1963). This ...
A skew conic, also known as a gauche conic, space conic, twisted conic, or cubical conic section, is a third-order space curve having up to three points in common with a ...
The Lagrange interpolating polynomial is the polynomial P(x) of degree <=(n-1) that passes through the n points (x_1,y_1=f(x_1)), (x_2,y_2=f(x_2)), ..., (x_n,y_n=f(x_n)), and ...
...
View search results from all Wolfram sites (30690 matches)

