Search Results for ""

The Sombor spectral radius rho_(Sombor) of a graph is defined as the largest eigenvalue of the Sombor matrix. Liu et al. (2022) shows that for any tree, ...

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 ...

Chió pivotal condensation is a method for evaluating an n×n determinant in terms of (n-1)×(n-1) determinants. It also leads to some remarkable determinant identities (Eves ...

If V and W are Banach spaces and T:V->W is a bounded linear operator, the T is said to be a compact operator if it maps the unit ball of V into a relatively compact subset of ...

The group theoretical term for what is known to physicists, by way of its connection with matrix traces, as the trace. The powerful group orthogonality theorem gives a number ...

A minor M_(ij) is the reduced determinant of a determinant expansion that is formed by omitting the ith row and jth column of a matrix A. So, for example, the minor M_(22) of ...

The Hoffman graph is the bipartite graph on 16 nodes and 32 edges illustrated above that is cospectral to the tesseract graph Q_4 (Hoffman 1963, van Dam and Haemers 2003). ...

The conjugate gradient method can be viewed as a special variant of the Lanczos method for positive definite symmetric systems. The minimal residual method (MINRES) and ...

The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...

A hyperbolic linear map R^n->R^n with integer entries in the transformation matrix and determinant +/-1 is an Anosov diffeomorphism of the n-torus, called an Anosov ...