Search Results for ""

Sphere tetrahedron picking is the selection of quadruples of of points corresponding to vertices of a tetrahedron with vertices on the surface of a sphere. n random ...

Surface area is the area of a given surface. Roughly speaking, it is the "amount" of a surface (i.e., it is proportional to the amount of paint needed to cover it), and has ...

The metabidiminished icosahedron is a convex equilateral solid that is Johnson solid J_(62). The unit metabidiminished icosahedron has volume V=1/6(5+2sqrt(5)) (1) and Dehn ...

There are a number of attractive polyhedron compounds consisting of seven octahedra. The compound illustrated above can be constructed as the dual of cube 7-compound. The ...

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).

The truncated Witt graph is the graph on 506 vertices related to a 4-(23,8,4) design (Brouwer et al. 1989, p. 367). It is called the M_(23) graph by van Dam and Haemers ...

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

The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...

The singleton graph is the graph consisting of a single isolated node with no edges. It is therefore the empty graph on one node. It is commonly denoted K_1 (i.e., the ...

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