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

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

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 quantity which does not exhibit estimator bias. An estimator theta^^ is an unbiased estimator of theta if <theta^^>=theta.

Variables x_i and x_j are said to be uncorrelated if their covariance is zero: cov(x_i,x_j)=0. Independent statistics are always uncorrelated, but the converse is not ...

A sequence of numbers alpha_n is said to be uncorrelated if it satisfies lim_(n->infty)1/(2n)sum_(m=-n)^nalpha_m^2=1 lim_(n->infty)1/(2n)sum_(m=-n)^nalpha_malpha_(k+m)=0 for ...