Search Results for ""

Jessen's orthogonal icosahedron is a concave shaky polyhedron constructed by replacing six pairs of adjacent triangles in an icosahedron (whose edges form a skew ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

A multistable polyhedron is a polyhedron that can change form from one stable configuration to another with only a slight transient nondestructive elastic stretch (Goldberg ...

"Neighborhood" is a word with many different levels of meaning in mathematics. One of the most general concepts of a neighborhood of a point x in R^n (also called an ...

A number of graphs are associated with P. J. Owens. The 76-node Owens graph (Owens 1980) provides the smallest known example of a polyhedral quintic nonhamiltonian graph. It ...

The pentagonal dipyramid is one of the convex deltahedra, and Johnson solid J_(13). It is also the dual polyhedron of the pentagonal prism U_(76) and is an isohedron. It is ...

Let Omega be an open, bounded, and connected subset of R^d for some d and let dx denote d-dimensional Lebesgue measure on R^d. In functional analysis, the Poincaré inequality ...

The geometric centroid of a polyhedron composed of N triangular faces with vertices (a_i,b_i,c_i) can be computed using the curl theorem as x^_ = ...

If the faces of a convex polyhedron were made of metal plates and the polyhedron edges were replaced by hinges, the polyhedron would be rigid. The theorem was stated by ...

A self-dual graphs is a graph that is dual to itself. Wheel graphs are self-dual, as are the examples illustrated above. Naturally, the skeleton of a self-dual polyhedron is ...