Search Results for ""

The Soicher graphs are three distance-regular graphs on 5346, 486, and 315 vertices, respectively. The first two are also distance-transitive but the third is not. The second ...

A solenoidal vector field satisfies del ·B=0 (1) for every vector B, where del ·B is the divergence. If this condition is satisfied, there exists a vector A, known as the ...

A closed three-dimensional figure (which may, according to some terminology conventions, be self-intersecting). Kern and Bland (1948, p. 18) define a solid as any limited ...

Solid partitions are generalizations of plane partitions. MacMahon (1960) conjectured the generating function for the number of solid partitions was ...

A Lie algebra g is solvable when its Lie algebra commutator series, or derived series, g^k vanishes for some k. Any nilpotent Lie algebra is solvable. The basic example is ...

A solvable Lie group is a Lie group G which is connected and whose Lie algebra g is a solvable Lie algebra. That is, the Lie algebra commutator series ...

The Sombor energy of a graph is defined as the graph energy of its Sombor matrix, i.e., the sum of the absolute values of the eigenvalues of its Sombor matrix.

The Sombor index of a graph is defined as half the sum of the matrix elements of its Sombor matrix.

The Sombor matrix A_(Sombor) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the graph. In ...

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