Search Results for ""

A complete tripartite graph is the k=3 case of a complete k-partite graph. In other words, it is a tripartite graph (i.e., a set of graph vertices decomposed into three ...

The Errera graph is the 17-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

The Wiener-Araya graph (Wiener and Araya 2009) is the 42-vertex graph illustrated above that was the smallest known example of a planar hypohamiltonian graph, beating the ...

A string or word is said to be admissible if that word appears in a given sequence. For example, in the sequence aabaabaabaabaab..., a, aa, baab are all admissible, but bb is ...

An alpha value is a number 0<=alpha<=1 such that P(z>=z_(observed))<=alpha is considered "significant," where P is a P-value.

A set (usually of letters) from which a subset is drawn. A sequence of letters is called a word, and a set of words is called a code.

alpha=1/Nsum_(i=1)^N|x_i-mu|=<|x_i-mu|>.

An estimator which exhibits estimator bias.

An interval into which a given data point does or does not fall.

The number of empty neighbors of a cluster.