Search Results for ""

A board covered by a lattice of pegs around which one can span rubber bands to form segments and polygons. It was invented by the Egyptian mathematician and pedagogist Caleb ...

The Gergonne line is Oldknow's (1996) term for the perspectrix of a contact triangle DeltaDEF and its reference triangle DeltaABC. It is determined by the Nobbs points D^', ...

Let there be m doctors and n<=m patients, and let all mn possible combinations of examinations of patients by doctors take place. Then what is the minimum number of surgical ...

The Golay code is a perfect linear error-correcting code. There are two essentially distinct versions of the Golay code: a binary version and a ternary version. The binary ...

The second blackboard problem in the 1997 film Good Will Hunting asks for all the series-reduced trees (referred to by the alternate term "homeomorphically irreducible trees" ...

A bridge of a connected graph is a graph edge whose removal disconnects the graph (Chartrand 1985, p. 45; Skiena 1990, p. 177). More generally, a bridge is an edge of a ...

A shortest path between two graph vertices (u,v) of a graph (Skiena 1990, p. 225). There may be more than one different shortest paths, all of the same length. Graph ...

The join G=G_1+G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph union G_1 union G_2 together with all the edges joining ...

The great dirhombicosidodecahedron is the uniform polyhedron with Maeder index 75 (Maeder 1997), Wenninger index 119 (Wenninger 1989), Coxeter index 82 (Coxeter et al. 1954), ...

The great ditrigonal dodecicosidodecahedron is the uniform polyhedron with Maeder index 42 (Maeder 1997), Wenninger index 81 (Wenninger 1989), Coxeter index 54 (Coxeter et ...