Search Results for ""

Square triangle picking is the selection of triples of points (corresponding to endpoints of a triangle) randomly placed inside a square. n random triangles can be picked in ...

Stellation is the process of constructing polyhedra by extending the facial planes past the polyhedron edges of a given polyhedron until they intersect (Wenninger 1989). The ...

There are several differing definitions of the sun graph. ISGCI defines a (complete) n-sun graph as a graph on 2n nodes (sometimes also known as a trampoline graph; ...

"The" Sylvester graph is a quintic graph on 36 nodes and 90 edges that is the unique distance-regular graph with intersection array {5,4,2;1,1,4} (Brouwer et al. 1989, ...

Thurston's conjecture proposed a complete characterization of geometric structures on three-dimensional manifolds. Before stating Thurston's geometrization conjecture in ...

The Tilley graph is a polyhedral graph that arises in the investigation of Kempe chainsKempe Chain (Tilley 2018). It has 12 vertices, 29 edges, and 19 faces (one of which is ...

The torus grid graph T_(m,n) is the graph formed from the graph Cartesian product C_m square C_n of the cycle graphs C_m and C_n. C_m square C_n is isomorphic to C_n square ...

The skeleton of a trapezohedron may be termed a trapezohedral graph. n-trapezohedral graphs are illustrated above for n=3 to 10 in circular embeddings with the two interior ...

The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...

The truncated icosahedron is the 32-faced Archimedean solid with 60 vertices corresponding to the facial arrangement 20{6}+12{5}. It is also the uniform polyhedron with ...