Search Results for ""

The set of graph eigenvalues of the adjacency matrix is called the spectrum of the graph. (But note that in physics, the eigenvalues of the Laplacian matrix of a graph are ...

The Laplacian matrix, sometimes also called the admittance matrix (Cvetković et al. 1998, Babić et al. 2002) or Kirchhoff matrix, of a graph G, where G=(V,E) is an ...

A measure which takes values in the complex numbers. The set of complex measures on a measure space X forms a vector space. Note that this is not the case for the more common ...

The Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...

The natural norm induced by the L-infty-norm is called the maximum absolute row sum norm and is defined by ||A||_infty=max_(i)sum_(j=1)^n|a_(ij)| for a matrix A. This matrix ...

A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...

Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...

The arithmetic-geometric index of a graph is defined as half the sum of the matrix elements of its arithmetic-geometric matrix.

A method which can be used to solve some classes of integral equations and is especially useful in implementing certain types of data inversion. It has been applied to invert ...

For any Abelian group G and any natural number n, there is a unique space (up to homotopy type) such that all homotopy groups except for the nth are trivial (including the ...