Search Results for ""

Special functions which arise as solutions to second order ordinary differential equations are commonly said to be "of the first kind" if they are nonsingular at the origin, ...

The Harary index of a graph G on n vertices was defined by Plavšić et al. (1993) as H(G)=1/2sum_(i=1)^nsum_(j=1)^n(RD)_(ij), (1) where (RD)_(ij)={D_(ij)^(-1) if i!=j; 0 if ...

Given a factor a of a number n=ab, the cofactor of a is b=n/a. A different type of cofactor, sometimes called a cofactor matrix, is a signed version of a minor M_(ij) defined ...

A square-free graph is a graph containing no graph cycles of length four. A simple graph is square-free iff c_4=1/8[Tr(A^4)-2m-2sum_(i!=j)a_(ij)^((2))]=0, where A is the ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...

The matrix product of a square set of data d and a matrix of basis vectors consisting of Walsh functions. By taking advantage of the nested structure of the natural ordering ...

Let the characteristic polynomial of an n×n complex matrix A be written in the form P(lambda) = |lambdaI-A| (1) = ...

Let A=a_(ij) be an n×n matrix with complex (or real) entries and eigenvalues lambda_1, lambda_2, ..., lambda_n, then sum_(i=1)^n|lambda_i|^2<=sum_(i,j=1)^n|a_(ij)|^2 (1) ...

The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...

A special point which usually has some symmetric placement with respect to points on a curve or in a solid. The center of a circle is equidistant from all points on the ...