Search Results for ""

An asymmetric matrix is a square matrix that is not symmetric, i.e., a matrix A such that A^(T)!=A, where A^(T) denotes the transpose. An asymmetric matrix therefore ...

The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...

The result of a matrix multiplication.

A Cartan matrix is a square integer matrix who elements (A_(ij)) satisfy the following conditions. 1. A_(ij) is an integer, one of {-3,-2,-1,0,2}. 2. A_(ii)=2 the diagonal ...

Let S={x_1,...,x_n} be a set of n distinct positive integers. Then the matrix [S]_n having the least common multiple LCM(x_i,x_j) of x_i and x_j as its i,jth entry is called ...

A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...

A k-matrix is a kind of cube root of the identity matrix (distinct from the identity matrix) which is defined by the complex matrix k=[0 0 -i; i 0 0; 0 1 0]. It satisfies ...

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...

A diagonal matrix whose diagonal elements all contain the same scalar lambda. A scalar matrix is therefore equivalent to lambdaI, where I is the identity matrix.

A square matrix which is not reducible is said to be irreducible.