Search Results for ""

Rubik's graph is the Cayley graph of Rubik's group. The graph diameter of this graph is sometimes known as God's number, and was shown in Aug. 2010 to be equal to 20 (Rokicki ...

The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...

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

All the propositions in projective geometry occur in dual pairs which have the property that, starting from either proposition of a pair, the other can be immediately ...

"The" I graph is the path graph on two vertices: P_2. An I-graph I(n,j,k) for 1<=j,k<n and j,k!=n/2 is a generalization of a generalized Petersen graph and has vertex set ...

A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest ...

The Kepler-Poinsot polyhedra are four regular polyhedra which, unlike the Platonic solids, contain intersecting facial planes. In addition, two of the four Kepler-Poinsot ...

The wreath graph W(n,k) is the graph obtained by taking n collections of k nodes and arranging around a circle such that all nodes in adjacent collections are connected. ...

There are at least two definitions of hypercomplex numbers. Clifford algebraists call their higher dimensional numbers hypercomplex, even though they do not share all the ...

The minimal polynomial of a matrix A is the monic polynomial in A of smallest degree n such that p(A)=sum_(i=0)^nc_iA^i=0. (1) The minimal polynomial divides any polynomial q ...