Search Results for ""

A graph G is said to be flexible if the vertices of G can be moved continuously so that (1) the distances between adjacent vertices are unchanged, and (2) at least two ...

Let four lines in a plane represent four roads in general position, and let one traveler T_i be walking along each road at a constant (but not necessarily equal to any other ...

A fractional clique of a graph G is a nonnegative real function on the vertices of G such that sum of the values on the vertices of any independent set is at most one. The ...

Consider a finite collection of points p=(p_1,...,p_n), p_i in R^d Euclidean space (known as a configuration) and a graph G whose graph vertices correspond to pairs of points ...

Frequency representation is the notation (1^(a_1)2^(a_2)...) used to abbreviate a partition {1,...,1_()_(a_1),2,...,2_()_(a_2),...} (Andrews 1998, p. 1).

Let t be an infinite word over a finite alphabet Sigma. Then there exists a uniformly recurrent infinite word r such that Sub(r) subset= Sub(t), where Sub(w) is the set of ...

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

One billion (10^9) bytes. Unfortunately, the term is sometimes also used to mean 2^(30)=1024^3=1073741824 bytes. However, this usage is deprecated, and the term gibibyte is ...

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...