Search Results for ""
131 - 140 of 464 for Combinatorial designSearch Results
One of the beautiful arrangements of circles found at the Temple of Osiris at Abydos, Egypt (Rawles 1997). The pattern also appears in Phoenician art from the 9th century BC ...
The Gewirtz graph, sometimes also called the Sims-Gewirtz graph (Brouwer), is an integral graph on 56 nodes and 280 edges that is also a regular graph of order 10. It is ...
A group action G×Omega->Omega might preserve a special kind of partition of Omega called a system of blocks. A block is a subset Delta of Omega such that for any group ...
The Ivanov-Ivanov-Faradjev graph is a distance-regular graph on 990 vertices (Brouwer et al. 1989, p. 369). It has intersection array {7,6,4,4,4,1,1,1;1,1,1,2,4,4,6,7} and is ...
The Leonard graph is a distance-regular graph on 288 vertices (Brouwer et al. 1989, p. 369) with intersection array {12,11,10,7;1,2,5,12}. It is however not ...
Linkages are linked (or constrained) mechanical structures such as those used in robots, excavators, engines, etc. They are also extensively used for character animation in ...
The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...
The problem in computational geometry of identifying the point from a set of points which is nearest to a given point according to some measure of distance. The nearest ...
The placement of objects so that they touch in some specified manner, often inside a container with specified properties. For example, one could consider a sphere packing, ...
An expanded paper bag, cushion, or pillow has a distinctive shape. Given the dimensions of a flat rectangular bag with dimensions a, b, bounds for the maximum volume of ...
...
View search results from all Wolfram sites (34004 matches)

