Search Results for ""

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 statistical index P_G=[product((p_n)/(p_0))^(v_0)]^(1/Sigmav_0), where p_n is the price per unit in period n, q_n is the quantity produced in period n, and v_n=p_nq_n the ...

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

The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...

An arc of a graph, sometimes also called a flag, is an ordered pair of adjacent vertices (Godsil and Royle 2001, p. 59), sometimes also called a directed line (Harary 1994, ...