Search Results for ""

The Wigner 6j-symbols (Messiah 1962, p. 1062), commonly simply called the 6j-symbols, are a generalization of Clebsch-Gordan coefficients and Wigner 3j-symbol that arise in ...

A magic square is a square array of numbers consisting of the distinct positive integers 1, 2, ..., n^2 arranged such that the sum of the n numbers in any horizontal, ...

The factorial n! is defined for a positive integer n as n!=n(n-1)...2·1. (1) So, for example, 4!=4·3·2·1=24. An older notation for the factorial was written (Mellin 1909; ...

A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...

"The" octahedral graph is the 6-node 12-edge Platonic graph having the connectivity of the octahedron. It is isomorphic to the circulant graph Ci_6(1,2), the cocktail party ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

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

A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...

The chromatic polynomial pi_G(z) of an undirected graph G, also denoted C(G;z) (Biggs 1973, p. 106) and P(G,x) (Godsil and Royle 2001, p. 358), is a polynomial which encodes ...

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...