TOPICS
Search

Search Results for ""


431 - 440 of 464 for Combinatorial designSearch Results
The game of billiards is played on a rectangular table (known as a billiard table) upon which balls are placed. One ball (the "cue ball") is then struck with the end of a ...
Catalan's constant is a constant that commonly appears in estimates of combinatorial functions and in certain classes of sums and definite integrals. It is usually denoted K ...
A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...
The Fields Medals are commonly regarded as mathematics' closest analog to the Nobel Prize (which does not exist in mathematics), and are awarded every four years by the ...
Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...
A fullerene is a cubic polyhedral graph having all faces 5- or 6-cycles. Examples include the 20-vertex dodecahedral graph, 24-vertex generalized Petersen graph GP(12,2), ...
Geometry is the study of figures in a space of a given number of dimensions and of a given type. The most common types of geometry are plane geometry (dealing with objects ...
An n-mark Golomb ruler is a set of n distinct nonnegative integers (a_1,a_2,...,a_n), called "marks," such that the positive differences |a_i-a_j|, computed over all possible ...
Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...
The genus gamma(G) of a graph G is the minimum number of handles that must be added to the plane to embed the graph without any crossings. A graph with genus 0 is embeddable ...
1 ... 41|42|43|44|45|46|47 Previous Next

...