Search Results for ""

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...

The uniform polyhedra are polyhedra consisting of regular (possibly polygrammic) faces of equal edge length whose polyhedron vertices are all symmetrically equivalent. The ...

A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...

Multiply all the digits of a number n by each other, repeating with the product until a single digit is obtained. The number of steps required is known as the multiplicative ...

The pentagrammic concave deltohedron (Har'El 1993) is the dual polyhedron of the pentagrammic crossed antiprism U_(80). It is perhaps more commonly known as the pentagrammic ...

The 16-cell beta_4 is the finite regular four-dimensional cross polytope with Schläfli symbol {3,3,4}. It is also known as the hyperoctahedron (Buekenhout and Parker 1998) or ...

Gray (1997) defines Bour's minimal curve over complex z by x^' = (z^(m-1))/(m-1)-(z^(m+1))/(m+1) (1) y^' = i((z^(m-1))/(m-1)+(z^(m+1))/(m+1)) (2) z^' = (2z^m)/m, (3) and then ...

The Boy surface is a nonorientable surface that is one possible parametrization of the surface obtained by sewing a Möbius strip to the edge of a disk. Two other ...

The correlation coefficient, sometimes also called the cross-correlation coefficient, Pearson correlation coefficient (PCC), Pearson's r, the Perason product-moment ...

The cross-correlation of two complex functions f(t) and g(t) of a real variable t, denoted f*g is defined by f*g=f^_(-t)*g(t), (1) where * denotes convolution and f^_(t) is ...