Search Results for ""

In three dimensions, a parallelepiped is a prism whose faces are all parallelograms. Let A, B, and C be the basis vectors defining a three-dimensional parallelepiped. Then ...

A Möbius ladder, sometimes called a Möbius wheel (Jakobson and Rivin 1999), of order n is a simple graph obtained by introducing a twist in a prism graph of order n that is ...

A pyramid with a hexagonal base. The edge length of a hexagonal pyramid of height h is a special case of the formula for a regular n-gonal pyramid with n=6, given by ...

A closed box composed of three pairs of rectangular faces placed opposite each other and joined at right angles to each other, also known as a rectangular parallelepiped. The ...

The term "wedge" has a number of different meanings in mathematics. It is sometimes used as another name for the caret symbol. The term also refers to the notation ( ^ ) used ...

The Franklin graph is the 12-vertex cubic graph shown above whose embedding on the Klein bottle divides it into regions having a minimal coloring using six colors, thus ...

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...

The Hall-Janko near octagon, also known as the Cohen-Tits near octagon, is a weakly regular graph on 315 vertices with parameters (n,k,lambda,mu)=(315,(10),(1),(0,1)). It is ...

A plane shape constructed by Reinhardt (1934) that is conjectured to be the "worst" packer of all centrally-symmetric plane regions. It has a packing density of ...

The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...