Search Results for ""

A function f:{0,1}^(l(n))×{0,1}^n->{0,1}^(m(n)) is a trapdoor one-way hash function if f is a trapdoor one-way function and is also a one-way hash function, i.e., if, ...

The set of all centroid points in a weighted tree (Harary 1994, p. 36).

The height of a tree g is defined as the vertex height of its root vertex, where the vertex height of a vertex v in a tree g is the number of edges on the longest downward ...

A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.

A triangular grid, also called an isometric grid (Gardner 1986, pp. 209-210), is a grid formed by tiling the plane regularly with equilateral triangles.

A sphere with three handles (and three holes), i.e., a genus-3 torus.

A statement which is rigorously known to be correct. A statement which is not true is called false, although certain statements can be proved to be rigorously undecidable ...

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

The algebra structure of linear functionals on polynomials of a single variable (Roman 1984, pp. 2-3).