Search Results for ""

A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is ...

A plane curve proposed by Descartes to challenge Fermat's extremum-finding techniques. In parametric form, x = (3at)/(1+t^3) (1) y = (3at^2)/(1+t^3). (2) The curve has a ...

Denote the nth derivative D^n and the n-fold integral D^(-n). Then D^(-1)f(t)=int_0^tf(xi)dxi. (1) Now, if the equation D^(-n)f(t)=1/((n-1)!)int_0^t(t-xi)^(n-1)f(xi)dxi (2) ...

A geometric series sum_(k)a_k is a series for which the ratio of each two consecutive terms a_(k+1)/a_k is a constant function of the summation index k. The more general case ...

A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...

The center of a graph G is the set of vertices of graph eccentricity equal to the graph radius (i.e., the set of central points). In the above illustration, center nodes are ...

The graph tensor product, also called the graph cardinal product (Imrich 1998), graph categorical product, graph conjunction, graph direct product (Hammack et al. 2016), ...

The great truncated icosidodecahedron, also called the great quasitruncated icosidodecahedron, is the uniform polyhedron with Maeder index 68 (Maeder 1997), Wenninger index ...

The harmonic mean H(x_1,...,x_n) of n numbers x_i (where i=1, ..., n) is the number H defined by 1/H=1/nsum_(i=1)^n1/(x_i). (1) The harmonic mean of a list of numbers may be ...

A d-dimensional discrete percolation model is said to be inhomogeneous if different graph edges (in the case of bond percolation models) or vertices (in the case of site ...