Search Results for ""

Let G be a simple graph with nonsingular (0,1) adjacency matrix A. If all the diagonal entries of the matrix inverse A^(-1) are zero and all the off-diagonal entries of ...

If T is a linear transformation of R^n, then the null space Null(T), also called the kernel Ker(T), is the set of all vectors X such that T(X)=0, i.e., Null(T)={X:T(X)=0}. ...

A nut graph is a graph on n>=2 vertices with adjacency matrix A such that A has matrix rank 1 and contains no 0 element (Sciriha 1998, 2008; Sciriha and Gutman, 1998; and ...

A system of curvilinear coordinates in which two sets of coordinate surfaces are obtained by revolving the curves of the elliptic cylindrical coordinates about the y-axis ...

O_h is the point group of symmetries of the octahedron having order 48 that includes inversion. It is also the symmetry group of the cube, cuboctahedron, and truncated ...

A (general) octahedron is a polyhedron having eight faces. Examples include the 4-trapezohedron, augmented triangular prism (Johnson solid J_(49)), bislit cube, Dürer solid, ...

If a univariate real function f(x) has a single critical point and that point is a local maximum, then f(x) has its global maximum there (Wagon 1991, p. 87). The test breaks ...

Given a sample of n variates X_1, ..., X_N, reorder them so that Y_1<Y_2<...<Y_N. Then Y_i is called the ith order statistic (Hogg and Craig 1970, p. 146), sometimes also ...

A d-dimensional discrete percolation model on a regular point lattice L=L^d is said to be oriented if L is an oriented lattice. One common such model takes place on the ...

A n×n matrix A is an orthogonal matrix if AA^(T)=I, (1) where A^(T) is the transpose of A and I is the identity matrix. In particular, an orthogonal matrix is always ...