Search Results for ""

The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...

The Laguerre polynomials are solutions L_n(x) to the Laguerre differential equation with nu=0. They are illustrated above for x in [0,1] and n=1, 2, ..., 5, and implemented ...

The logarithmic spiral is a spiral whose polar equation is given by r=ae^(btheta), (1) where r is the distance from the origin, theta is the angle from the x-axis, and a and ...

A Moore graph of type (v,g) is a regular graph of vertex degree v>2 and girth g that contains the maximum possible number of nodes, namely ...

Starting with the circle P_1 tangent to the three semicircles forming the arbelos, construct a chain of tangent circles P_i, all tangent to one of the two small interior ...

A game played on a board of a given shape consisting of a number of holes of which all but one are initially filled with pegs. The goal is to remove all pegs but one by ...

A prime link is a link that cannot be represented as a knot sum of other links. Doll and Hoste (1991) list polynomials for oriented links of nine or fewer crossings, and ...

A general prism is a polyhedron possessing two congruent polygonal faces and with all remaining faces parallelograms (Kern and Bland 1948, p. 28; left figure). A right prism ...

The regular pentagon is the regular polygon with five sides, as illustrated above. A number of distance relationships between vertices of the regular pentagon can be derived ...

The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...