Search Results for ""

Am octagonal prims is a prism composed of octagonal faces. The regular right octagonal prism of unit edge length has surface area and volume S = 4(3+sqrt(2)) (1) V = ...

A pentagon is a five-sided polygon. Several special types of pentagons are illustrated above. In particular, a pentagon with vertices equally spaced around a circle and with ...

cos(pi/8) = 1/2sqrt(2+sqrt(2)) (1) cos((3pi)/8) = 1/2sqrt(2-sqrt(2)) (2) cot(pi/8) = 1+sqrt(2) (3) cot((3pi)/8) = sqrt(2)-1 (4) csc(pi/8) = sqrt(4+2sqrt(2)) (5) csc((3pi)/8) ...

A hexagon is a six-sided polygon. Several special types of hexagons are illustrated above. In particular, a hexagon with vertices equally spaced around a circle and with all ...

The Leonard graph is a distance-regular graph on 288 vertices (Brouwer et al. 1989, p. 369) with intersection array {12,11,10,7;1,2,5,12}. It is however not ...

The mean triangle area A^_ is the average area of a triangle in triangle picking within some given shape. As summarized in the following table, it is possible to compute the ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

A graph G is said to be locally X, where X is a graph (or class of graphs), when for every vertex v, the graph induced on G by the set of adjacent vertices of V (sometimes ...

The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...