Search Results for ""

A point in a weighted tree that has minimum weight for the tree. The set of all centroid points is called a tree centroid (Harary 1994, p. 36). The largest possible values ...

The equation f(x_n|x_s)=int_(-infty)^inftyf(x_n|x_r)f(x_r|x_s)dx_r which gives the transitional densities of a Markov sequence. Here, n>r>s are any integers (Papoulis 1984, ...

The 6-polyiamond illustrated above.

A node which is one graph edge further away from a given node in a rooted tree.

An alternative term for a binomial coefficient, in which (n; k) is read as "n choose k." R. K. Guy suggested this pronunciation around 1950, when the notations ^nC_r and ...

Let a graph G have graph vertices with vertex degrees d_1<=...<=d_m. If for every i<n/2 we have either d_i>=i+1 or d_(n-i)>=n-i, then the graph is Hamiltonian.

It is possible to place 7 cigarettes in such a way that each touches every other if l/d>7sqrt(3)/2 (Gardner 1959, p. 115).

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.

The ratio of a measure of the size of a "fit" to the size of a "residual."

Because of rounding, the stated class limits do not correspond to the actual ranges of data falling in them. For example, if the class limits are 1.00 and 2.00, then all ...