Search Results for ""

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.

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

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 algebra structure of linear functionals on polynomials of a single variable (Roman 1984, pp. 2-3).

An operator T which maps some basic polynomial sequence p_n(x) into another basic polynomial sequence q_n(x).

A point lattice which can be constructed from an arbitrary parallelogram of unit area. For any such planar lattice, the minimum distance c between any two points is a ...

A graph in which individual nodes have no distinct identifications except through their interconnectivity. Graphs in which labels (which are most commonly numbers) are ...