Search Results for ""

The Biggs-Smith graph is cubic symmetric graph F_(102)A on 102 vertices and 153 edges that is also distance-regular with intersection array {3,2,2,2,1,1,1;1,1,1,1,1,1,3} and ...

The Shrikhande graph is a strongly regular graph on 16 nodes. It is cospectral with the rook graph L_(4,4), so neither of the two is determined by spectrum. The Shrikhande ...

The Petersen graph is the cubic graph on 10 vertices and 15 edges which is the unique (3,5)-cage graph (Harary 1994, p. 175), as well as the unique (3,5)-Moore graph. It can ...

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

The group of classes of finite dimensional central simple algebras over k with respect to a certain equivalence.

A fractal produced by iteration of the equation z_(n+1)=z_n^2 (mod m) which results in a Moiré-like pattern.

Combinatorial game theory is the theory of two-player games of perfect knowledge such as go, chess, or checkers.

This statement seems incomplete. Locate a reference and complete statement of the condition. For any group of k men out of N, there must be at least k jobs for which they are ...

An equilibrium point in game theory is a set of strategies {x^^_1,...,x^^_n} such that the ith payoff function K_i(x) is larger or equal for any other ith strategy, i.e., ...

A problem in the theory of algebraic invariants that was solved by Hilbert using an existence proof.