Search Results for ""

An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).

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.

Let (X,tau) be a topological space, and let p in X. Then the arc component of p is union {A subset= X:A is an arc and p in A}.

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).

A double integral over three coordinates giving the area within some region R, A=intint_(R)dxdy. If a plane curve is given by y=f(x), then the area between the curve and the ...

A mathematical relationship relating f(x+y) to f(x) and f(y).

A mathematical relationship relating f(nx) to f(x) for integer n.

For positive numbers a and b with a!=b, (a+b)/2>(b-a)/(lnb-lna)>sqrt(ab).