Search Results for ""

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...

The 60 Pascal lines of a hexagon inscribed in a conic section intersect three at a time through 20 Steiner points. There is a dual relationship between the 15 Plücker lines ...

The 20 Cayley lines generated by a hexagon inscribed in a conic section pass four at a time though 15 points known as Salmon points (Wells 1991). There is a dual relationship ...

Let X be a normed space and X^(**)=(X^*)^* denote the second dual vector space of X. The canonical map x|->x^^ defined by x^^(f)=f(x),f in X^* gives an isometric linear ...

The tetragonal antiwedge graph is the skeleton of the tetragonal antiwedge. It is a has 6 vertices, 10 edges, and 6 faces. The tetragonal antiwedge graph is self-dual and is ...

The tetragonal trapezohedron is the dual of the square antiprism. For a square antiprism with unit edge lengths, the edge lengths of the corresponding tetragonal ...

The Császár polyhedron is a polyhedron that is topologically equivalent to a torus which was discovered in the late 1940s by Ákos Császár (Gardner 1975). It has 7 polyhedron ...

The dodecahedron-icosahedron compound is a polyhedron compound consisting of a dodecahedron and its dual the icosahedron. In the compound, the dodecahedron and icosahedron ...

Given a topological vector space X and a neighborhood V of 0 in X, the polar K=K(V) of V is defined to be the set K(V)={Lambda in X^*:|Lambdax|<=1 for every x in V} and where ...

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...