Search Results for ""

An antimagic graph is a graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex differ.

A relation R on a set S is antisymmetric provided that distinct elements are never both related to one another. In other words xRy and yRx together imply that x=y.

An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).

The 4-polyhex illustrated above (Gardner 1978, p. 147).

A map F from R^n to R^n is area-preserving if m(F^(-1)(A))=m(A) for every subregion A of R^n, where m(A) is the n-dimensional measure of A. A linear transformation is ...

A sequence {x_n} is called an infinitive sequence if, for every i, x_n=i for infinitely many n. Write a(i,j) for the jth index n for which x_n=i. Then as i and j range ...

The augmented hexagonal prism is Johnson solid J_(54), which is formed from augmentation of one of the lateral faces of an equilateral hexagonal prism by an equilateral ...

The average disorder number of a simple connected graph on n vertices is defined as the average length of a walk along the edges of the graph taken over all ordering of its ...

The average power of a complex signal f(t) as a function of time t is defined as <f^2(t)>=lim_(T->infty)1/(2T)int_(-T)^T|f(t)|^2dt, where |z| is the complex modulus (Papoulis ...

Given a function f(x) plotted in the Cartesian plane as y=f(x), the average rate of change (or average rate of change function) of f from x to a is given by ...