Search Results for ""

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...

The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...

The rook numbers r_k^((m,n)) of an m×n board are the number of subsets of size k such that no two elements have the same first or second coordinate. In other word, it is the ...

A procedure for decomposing an N×N matrix A into a product of a lower triangular matrix L and an upper triangular matrix U, LU=A. (1) LU decomposition is implemented in the ...

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 vector space generated by the columns of a matrix viewed as vectors. The column space of an n×m matrix A with real entries is a subspace generated by m elements of R^n, ...

Any square matrix A can be written as a sum A=A_S+A_A, (1) where A_S=1/2(A+A^(T)) (2) is a symmetric matrix known as the symmetric part of A and A_A=1/2(A-A^(T)) (3) is an ...

A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...

If a matrix A has a matrix of eigenvectors P that is not invertible (for example, the matrix [1 1; 0 1] has the noninvertible system of eigenvectors [1 0; 0 0]), then A does ...

A graphical partitioning based on the eigenvalues and eigenvectors of the Laplacian matrix of a graph.