Search Results for ""

Two or more lines which have no intersections but are not parallel, also called agonic lines. Since two lines in the plane must intersect or be parallel, skew lines can exist ...

The special unitary group SU_n(q) is the set of n×n unitary matrices with determinant +1 (having n^2-1 independent parameters). SU(2) is homeomorphic with the orthogonal ...

If an n-sided Poncelet transverse constructed for two given conic sections is closed for one point of origin, it is closed for any position of the point of origin. ...

The 16-cell beta_4 is the finite regular four-dimensional cross polytope with Schläfli symbol {3,3,4}. It is also known as the hyperoctahedron (Buekenhout and Parker 1998) or ...

An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...

According to Euler's rotation theorem, any rotation may be described using three angles. If the rotations are written in terms of rotation matrices D, C, and B, then a ...

The Hall-Janko graph, also known as the Hall-Janko-Wales graph, is a strongly regular graph on 100 nodes with parameters (nu,k,lambda,mu)=(100,36,14,12). It is also a ...

The Hamming graph H(d,q), sometimes also denoted q^d, is the graph Cartesian product of d copies of the complete graph K_q. H(d,q) therefore has q^d vertices. H(d,q) has ...

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