Search Results for ""

The skeleton graphs of the Johnson solids are polyhedral graphs. The Johnson skeleton graphs J_3 and J_(63) are minimal unit-distance forbidden graphs. The skeleton of the ...

The imaginary number i=sqrt(-1), i.e., the square root of -1. The imaginary unit is denoted and commonly referred to as "i." Although there are two possible square roots of ...

An approximate unit for a C^*-algebra A is an increasing net {u_lambda}_(lambda in Lambda) of positive elements in the closed unit ball of A such that a=lim_(lambda)au_lambda ...

The Errera graph is the 17-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

The triangular snake graph TS_n is the graph on n vertices with n odd defined by starting with the path graph P_(n-1) and adding edges (2i-1,2i+1) for i=1, ..., n-1. The ...

A square with side lengths 1. The unit square usually means the one with coordinates (0, 0), (1, 0), (1, 1), (0, 1) in the real plane, or 0, 1, 1+i, and i in the complex ...

The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named ...

An almost unit is a nonunit in the integral domain of formal power series with a nonzero first coefficient, P=a_1x+a_2x^2+..., where a_1!=0. Under the operation of ...

Flower graphs are a name given in this work to the generalization of the flower snarks J_n for positive n=5, 7, 9, ... to all integer n>=5. They are illustrated above for n=5 ...