Search Results for ""
1671 - 1680 of 13135 for TopologySearch Results
The greatest radial distance of an ellipse as measured from a focus. Taking v=pi in the equation of an ellipse r=(a(1-e^2))/(1+ecosv) gives the apoapsis distance r_+=a(1+e). ...
Given a circle, the apothem is the perpendicular distance r from the midpoint of a chord to the circle's center. It is also equal to the radius R minus the sagitta h, r=R-h. ...
A homographic transformation x_1 = (ax+by+c)/(a^('')x+b^('')y+c^('')) (1) y_1 = (a^'x+b^'y+c^')/(a^('')x+b^('')y+c^('')) (2) with t_1 substituted for t according to ...
An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).
A formal mathematical theory which introduces "components at infinity" by defining a new type of divisor class group of integers of a number field. The divisor class group is ...
Araya and Wiener (2011) found the two cubic planar hypohamiltonian graphs on 70 and 88 vertices, respectively, illustrated above.
A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.
A unit of angular measure equal to 60 arc seconds, or 1/60 of a degree. The arc minute is denoted ^' (not to be confused with the symbol for feet).
The arc set of a directed graph is the set of all arcs (directed edges) of the graph. The arc set for a directed graph g is given in the Wolfram Language by EdgeList[g].
The 4-polyhex illustrated above (Gardner 1978, p. 147).
...
View search results from all Wolfram sites (13807 matches)

