Search Results for ""

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

Guilloché patterns are spirograph-like curves that frame a curve within an inner and outer envelope curve. They are used on banknotes, securities, and passports worldwide for ...

The circle H which touches the incircles I, I_A, I_B, and I_C of a circular triangle ABC and its associated triangles. It is either externally tangent to I and internally ...

The Heesch number of a closed plane figure is the maximum number of times that figure can be completely surrounded by copies of itself. The determination of the maximum ...

The Hochberg-O'Donnell fish graph is the unit-distance graph on 23 nodes and 42 edges illustrated above. It is triangle-free and is the smallest example of a unit-distance ...

There are (at least) two graphs associated with Horton, illustrated above. The first is a graph on 96 nodes providing a counterexample to the Tutte conjecture that every ...

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

There are at least two definitions of hypercomplex numbers. Clifford algebraists call their higher dimensional numbers hypercomplex, even though they do not share all the ...