Search Results for ""

A tree not having the complete bipartite graph K_(1,2) with base at the vertex of degree two as a limb (Lu et al. 1993, Lu 1996).

A mixed graph in which both directed and undirected edges may exist. If only directed edges exist, the graph is called a directed graph. If only undirected edges exist, it is ...

The 4-polyhex illustrated above.

An (n,k)-talisman hexagon is an arrangement of nested hexagons containing the integers 1, 2, ..., H_n=3n(n-1)+1, where H_n is the nth hex number, such that the difference ...

The mutual information between two discrete random variables X and Y is defined to be I(X;Y)=sum_(x in X)sum_(y in Y)P(x,y)log_2((P(x,y))/(P(x)P(y))) (1) bits. Additional ...

For a discrete function f(n), the summatory function is defined by F(n)=sum_(k in D)^nf(k), where D is the domain of the function.

The order ideal in Lambda, the ring of integral laurent polynomials, associated with an Alexander matrix for a knot K. Any generator of a principal Alexander ideal is called ...

The evolute of the astroid is a hypocycloid evolute for n=4. Surprisingly, it is another astroid scaled by a factor n/(n-2)=4/2=2 and rotated 1/(2·4)=1/8 of a turn. For an ...

For a measurable function mu, the Beltrami differential equation is given by f_(z^_)=muf_z, where f_z is a partial derivative and z^_ denotes the complex conjugate of z.

A relation between compact boundaryless manifolds (also called closed manifolds). Two closed manifolds are bordant iff their disjoint union is the boundary of a compact ...