Search Results for ""

The Goddard-Henning graph, illustrated above in several embeddings, is the 9-node planar graph of graph diameter 2 having domination number gamma=3. It was first constructed ...

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...

A two-coloring of a complete graph K_n of n nodes which contains exactly the number of monochromatic forced triangles and no more (i.e., a minimum of R+B where R and B are ...

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

The great icosicosidodecahedron, not to be confused with the great icosahedron or great icosidodecahedron, is the uniform polyhedron with Maeder index 48 (Maeder 1997), ...

The great icosihemidodecahedron is the uniform polyhedron with Maeder index 71 (Maeder 1997), Wenninger index 106 (Wenninger 1989), Coxeter index 85 (Coxeter et al. 1954), ...

The great stellated truncated dodecahedron, also called the quasitruncated great stellated dodecahedron is the uniform polyhedron with Maeder index 66 (Maeder 1997), ...

The Hall graph is a distance-transitive graph on 65 vertices having intersection array {10,6,4,1;1,2,5} (Hall 1980). It is denoted Gamma^((3)) by Hall (1980) and was ...

A heart-shaped surface given by the sextic equation (x^2+9/4y^2+z^2-1)^3-x^2z^3-9/(80)y^2z^3=0 (Taubin 1993, 1994). The figures above show a ray-traced rendering (left) and ...

A hexagonal prism is a prism composed of two hexagonal bases and six rectangular sides. It is an octahedron. The regular right hexagonal prism is a space-filling polyhedron. ...