Search Results for ""

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

A number of attractive tetrahedron 6-compounds can be constructed. The first compound (left figures) is obtained by combining three stella octangula. A second can be obtained ...

Cubic graphs, also called trivalent graphs, are graphs all of whose nodes have degree 3 (i.e., 3-regular graphs). Cubic graphs on n nodes exists only for even n (Harary 1994, ...

The regular hexagon is the regular polygon with six sides, as illustrated above. The inradius r, circumradius R, sagitta s, and area A of a regular hexagon can be computed ...

A polycube composed of 5 cubes. There are 29 distinct three-dimensional pentacubes (Bouwkamp 1981). Of these, the 12 planar pentacubes (corresponding to solid pentominoes), ...

Three-dimensional generalization of the polyominoes to n dimensions. The number of polycubes N(n) composed of n cubes are 1, 1, 2, 8, 29, 166, 1023, ... (OEIS A000162; Ball ...

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

The great rhombicosidodecahedro is the 62-faced Archimedean solid with faces 30{4}+20{6}+12{10}. It is also known as the rhombitruncated icosidodecahedron, and is sometimes ...

A (0,2)-graph is a connected graph such that any two vertices have 0 or 2 common neighbors. (0,2)-graphs are regular, and the numbers of (0,2)-graphs with vertex degree 0, 1, ...