Search Results for ""

If the Tutte polynomial T(x,y) of a graph G is given by sumt_(rs)x^ry^s, then the matrix (t_(rs)) is called the rank matrix of G. For example, the Tutte matrix of the ...

Let a cotree of a spanning tree T in a connected graph G be denoted T^*. Then the edges of G which are not in T^* are called its twigs (Harary 1994, p. 39).

A class of area-preserving maps of the form theta_(i+1) = theta_i+2pialpha(r_i) (1) r_(i+1) = r_i, (2) which maps circles into circles but with a twist resulting from the ...

Except for triangles, every simple polygon has at least two nonoverlapping ears.

The two-point form of a line in the Cartesian plane passing through the points (x_1,y_1) and (x_2,y_2) is given by y-y_1=(y_2-y_1)/(x_2-x_1)(x-x_1), or equivalently, ...

An error in a statistical test which occurs when a false hypothesis is accepted (a false positive in terms of the null hypothesis).

An error in a statistical test which occurs when a true hypothesis is rejected (a false negative in terms of the null hypothesis).

f(x)=1-2x^2 for x in [-1,1]. Fixed points occur at x=-1, 1/2, and order 2 fixed points at x=(1+/-sqrt(5))/4. The natural invariant of the map is rho(y)=1/(pisqrt(1-y^2)).

Let graph G have p points v_i and graph H have p points u_i, where p>=3. Then if for each i, the subgraphs G_i=G-v_i and H_i=H-u_i are isomorphic, then the graphs G and H are ...

The function defined by U(n)=(n!)^(n!). The values for n=0, 1, ..., are 1, 1, 4, 46656, 1333735776850284124449081472843776, ... (OEIS A046882).