Search Results for ""

A graph corresponding to the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, all of which are regular, planar, polyhedral, and Hamiltonian. The ...

The Berlekamp-van Lint-Seidel graph is the Hamiltonian strongly regular graph on 243 vertices with parameters (243,22,1,2). It is also distance-regular with intersection ...

A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...

An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...

A finite group L is quasisimple if L=[L,L] and L/Z(L) is a simple group.

A property of finite simple groups which is known for all such groups.

Triangulation is the division of a surface or plane polygon into a set of triangles, usually with the restriction that each triangle side is entirely shared by two adjacent ...

The constant pi, denoted pi, is a real number defined as the ratio of a circle's circumference C to its diameter d=2r, pi = C/d (1) = C/(2r) (2) pi has decimal expansion ...

A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...

A gamma distribution is a general type of statistical distribution that is related to the beta distribution and arises naturally in processes for which the waiting times ...