Search Results for ""

A hypothetic building design problem in optimization with constraints proposed by Bhatti (2000, pp. 3-5). To save energy costs for heating and cooling, an architect wishes to ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

The M_(22) graph, also known as the 77-graph, is a strongly regular graph on 77 nodes related to the Mathieu group M_(22) and to the Witt design. It is illustrated above in ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

The truncated Witt graph is the graph on 506 vertices related to a 4-(23,8,4) design (Brouwer et al. 1989, p. 367). It is called the M_(23) graph by van Dam and Haemers ...

Coding theory, sometimes called algebraic coding theory, deals with the design of error-correcting codes for the reliable transmission of information across noisy channels. ...

A symmetric block design (4n+3, 2n+1, n) which is equivalent to a Hadamard matrix of order 4n+4. It is conjectured that Hadamard designs exist for all integers n>0, but this ...

Let S be a set of n+1 symbols, then a Howell design H(s,2n) on symbol set S is an s×s array H such that 1. Every cell of H is either empty or contains an unordered pair of ...

Resolution is a widely used word with many different meanings. It can refer to resolution of equations, resolution of singularities (in algebraic geometry), resolution of ...