Search Results for ""

Construct a square equal in area to a circle using only a straightedge and compass. This was one of the three geometric problems of antiquity, and was perhaps first attempted ...

A 3-cusped hypocycloid, also called a tricuspoid. The deltoid was first considered by Euler in 1745 in connection with an optical problem. It was also investigated by Steiner ...

An Euler brick is a cuboid that possesses integer edges a>b>c and face diagonals d_(ab) = sqrt(a^2+b^2) (1) d_(ac) = sqrt(a^2+c^2) (2) d_(bc) = sqrt(b^2+c^2). (3) If the ...

A geodesic is a locally length-minimizing curve. Equivalently, it is a path that a particle which is not accelerating would follow. In the plane, the geodesics are straight ...

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

The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...

The regular octahedron, often simply called "the" octahedron, is the Platonic solid with six polyhedron vertices, 12 polyhedron edges, and eight equivalent equilateral ...