Search Results for ""

There appear to be two different definitions of the standard error. The standard error of a sample of sample size n is the sample's standard deviation divided by sqrt(n). It ...

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...

A tetrahedral ring is a term given in this work to a set of n regular tetrahedra joined face-to-face sharing a common edge (with internal conjoined faces removed). These ...

The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...

A tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...

A curve which can be used to trisect an angle. Although an arbitrary angle cannot be trisected using only compass and straightedge (i.e., according to the strict rules of ...

A unicyclic graph is a connected graph containing exactly one cycle (Harary 1994, p. 41). A connected unicyclic graph is therefore a pseudotree that is not a tree. ...

A triangular matrix U of the form U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... a_(nn)]. ...

An urelement contains no elements, belongs to some set, and is not identical with the empty set (Moore 1982, p. 3; Rubin 1967, p. 23). "Ur" is a German prefix which is ...

The Voronov-Neopryatnaya-Dergachev graphs are two graphs on 372 and 972 vertices which have unit-distance embeddings with all vertices on a sphere and chromatic number 5. The ...