Search Results for ""

A generalized octagon GO(n,k) is a generalized polygon of order 8. GO(1,2) is the (3,8)-cage graph, the incidence graph of the Cremona-Richmond configuration, the cubic ...

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...

The trilinear pole of the orthotransversal of a point P is called its orthocorrespondent. The orthocorrespondent of a point P=p:q:r is given by where S_A, S_B, and S_C is ...

A notion introduced by R. M. Wilson in 1974. Given a finite graph G with n vertices, puz(G) is defined as the graph whose nodes are the labelings of G leaving one node ...

The rascal triangle is a number triangle with numbers arranged in staggered rows such that a_(n,r)=n(r-n)+1. (1) The published study of this triangle seems to have originated ...

Abstractly, a spatial configuration F is said to possess rotational symmetry if F remains invariant under the group C=C(F). Here, C(F) denotes the group of rotations of F and ...

Rubik's Cube is a 3×3×3 cube in which the 26 subcubes on the outside are internally hinged in such a way that rotation (by a quarter turn in either direction or a half turn) ...

Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...

The Schläfli double sixes graph is the Levi graph of the double sixes configuration.

Find the minimum size square capable of bounding n equal squares arranged in any configuration. The first few cases are illustrated above (Friedman). The only packings which ...