Search Results for ""

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

If two pairs of opposite sides of a complete quadrilateral are pairs of perpendicular lines, the quadrilateral is said to be orthocentric. In such a case, the remaining sides ...

A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving ...

An ordered finite configuration with certain pairs of points, called cables, which are constrained not to get further apart and certain other pairs of points, called struts, ...

Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...

Brown numbers are pairs (m,n) of integers satisfying the condition of Brocard's problem, i.e., such that n!+1=m^2 where n! is the factorial and m^2 is a square number. Only ...

In general, the word "complement" refers to that subset F^' of some set S which excludes a given subset F. Taking F and its complement F^' together then gives the whole of ...

Every complex matrix A can be broken into a Hermitian part A_H=1/2(A+A^(H)) (i.e., A_H is a Hermitian matrix) and an antihermitian part A_(AH)=1/2(A-A^(H)) (i.e., A_(AH) is ...

If P is a point on the circumcircle of a reference triangle, then the line PP^(-1), where P^(-1) is the isogonal conjugate of P, is called the antipedal line of P. It is a ...

The asterisk *, also called a "star," is used for a number of different purposed in mathematics. The most common usage is to denote multiplication so, for example, 2*3=2×3=6. ...