Search Results for ""

Tietze's graph is the cubic graph on 12 nodes and 18 edges illustrated above in a number of embeddings. It is implemented in the Wolfram Language as GraphData["TietzeGraph"]. ...

Togliatti (1940, 1949) showed that quintic surfaces having 31 ordinary double points exist, although he did not explicitly derive equations for such surfaces. Beauville ...

A transformation T (a.k.a., map, function) over a domain D takes the elements X in D to elements Y in T(D), where the range (a.k.a., image) of T is defined as ...

A fast boat is overtaking a slower one when fog suddenly sets in. At this point, the boat being pursued changes course, but not speed, and proceeds straight in a new ...

While the pedal point, Cevian point, and even pedal-Cevian point are commonly used concepts in triangle geometry, there seems to be no established term to describe the ...

If replacing each number by its square or cube in a magic square produces another magic square, the square is said to be a trimagic square. Trimagic squares are also called ...

Given a reference triangle DeltaABC and a point P, the triple (x,y,z), with x=PA, y=PB and z=PC representing the distances from P to the vertices of the reference triangle, ...

The truncated great dodecahedron is the uniform polyhedron with Maeder index 37 (Maeder 1997), Wenninger index 75 (Wenninger 1989), Coxeter index 47 (Coxeter et al. 1954), ...

A uniquely pancyclic graph is a graph that has exactly one cycle of each length between 3 and the graph's vertex count. Uniquely pancyclic graphs are therefore a special case ...

If ABB^' and AC^'C are straight lines with BC and B^'C^' intersecting at D and AB+BD=AC^'+C^'D, then AB^'+B^'D=AC+CD. The origin and some history of this theorem are ...