Search Results for ""

The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...

In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...

The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...

A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...

The quartic surface obtained by replacing the constant b in the equation of the Cassini ovals with b=z, obtaining [(x-a)^2+y^2][(x+a)^2+y^2]=z^4. (1) As can be seen by ...

A cyclide formed by inversion of a standard torus when inversion sphere is tangent to the torus.

A parabolic cyclide formed by inversion of a horn torus when the inversion sphere is tangent to the torus.

A parabolic cyclide formed by inversion of a ring torus when the inversion sphere is tangent to the torus.

A parabolic cyclide formed by inversion of a spindle torus when the inversion sphere is tangent to the torus.