Search Results for ""

Cantellation, also known as (polyhedron) expansion (Stott 1910, not to be confused with general geometric expansion) is the process of radially displacing the edges or faces ...

An equation is said to be a closed-form solution if it solves a given problem in terms of functions and mathematical operations from a given generally-accepted set. For ...

Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent (Harary 1994), so that one may speak of ...

A function built up of a finite combination of constant functions, field operations (addition, multiplication, division, and root extractions--the elementary operations)--and ...

If A=>B and B=>A (i.e., A=>B ^ B=>A, where => denotes implies), then A and B are said to be equivalent, a relationship which is written symbolically in this work as A=B. The ...

Exterior algebra is the algebra of the wedge product, also called an alternating algebra or Grassmann algebra. The study of exterior algebra is also called Ausdehnungslehre ...

A geodesic dome is a triangulation of a Platonic solid or other polyhedron to produce a close approximation to a sphere (or hemisphere). The nth order geodesation operation ...

Given any tree T having v vertices of vertex degrees of 1 and 3 only, form an n-expansion by taking n disjoint copies of T and joining corresponding leaves by an n-cycle ...

"The" I graph is the path graph on two vertices: P_2. An I-graph I(n,j,k) for 1<=j,k<n and j,k!=n/2 is a generalization of a generalized Petersen graph and has vertex set ...

A notion introduced by R. M. Wilson in 1974. Given a finite graph G with n vertices, puz(G) is defined as the graph whose nodes are the labelings of G leaving one node ...