Search Results for ""

The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. At first, the ants wander randomly. When an ant ...

Given a point P, the point P^' which is the antipodal point of P is said to be the antipode of P. The term antipode is also used in plane geometry. Given a central conic (or ...

The arithmetic-geometric energy of a graph is defined as the graph energy of its arithmetic-geometric matrix, i.e., the sum of the absolute values of the eigenvalues of its ...

The arithmetic-geometric index of a graph is defined as half the sum of the matrix elements of its arithmetic-geometric matrix.

The arithmetic-geometric matrix A_(AG) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the ...

The arithmetic-geometric spectral radius rho_(AG) of a graph is defined as the largest eigenvalue of its arithmetic-geometric matrix.

A ring is called left (respectively right) Artinian if it does not contain an infinite descending chain of left (resp. right) ideals. In this case the ring in question is ...

An augmented matrix is a matrix obtained by adjoining a row or column vector, or sometimes another matrix with the same vertical dimension. The most common use of an ...

A B-spline is a generalization of the Bézier curve. Let a vector known as the knot vector be defined T={t_0,t_1,...,t_m}, (1) where T is a nondecreasing sequence with t_i in ...

Baer's criterion, also known as Baer's test, states that a module M over a unit ring R is injective iff every module homomorphism from an ideal of R to M can be extended to a ...