Search Results for ""

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

A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

A perfect magic cube is a magic cube for which the rows, columns, pillars, space diagonals, and diagonals of each n×n orthogonal slice sum to the same number (i.e., the magic ...

The Kummer graph is the name apparently first adopted here for the Levi graph of Kummer's 16_6 configuration (Coxeter 1950), corresponding to the folded 6-cube graph (Brouwer ...

The mean triangle area of a triangle picked at random inside a unit cube is A^_=0.15107+/-0.00003, with variance var(A)=0.008426+/-0.000004. The distribution of areas, ...

The cyclotomic graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a cube in the finite field GF(q). This graph is ...

The Cartesian product of a countable infinity of copies of the interval [0,1]. It can be denoted [0,1]^(aleph_0) or [0,1]^omega, where aleph_0 and omega are the first ...

Cube point picking is the three-dimensional case of hypercube point picking. The average distance from a point picked at random inside a unit cube to the center is given by ...

A pandiagonal semiperfect magic cube is a semiperfect magic cube that remains semiperfect when any single orthogonal section is "restacked" cyclically so that the ordering of ...