Search Results for ""

A self-dual graphs is a graph that is dual to itself. Wheel graphs are self-dual, as are the examples illustrated above. Naturally, the skeleton of a self-dual polyhedron is ...

A mathematical object defined for a set and a binary operator in which the multiplication operation is associative. No other restrictions are placed on a semigroup; thus a ...

A sentence is a logic formula in which every variable is quantified. The concept of a sentence is important because formulas with variables that are not quantified are ...

The shah function is defined by m(x) = sum_(n=-infty)^(infty)delta(x-n) (1) = sum_(n=-infty)^(infty)delta(x+n), (2) where delta(x) is the delta function, so m(x)=0 for x not ...

The sign of a real number, also called sgn or signum, is -1 for a negative number (i.e., one with a minus sign "-"), 0 for the number zero, or +1 for a positive number (i.e., ...

A simple point process (or SPP) is an almost surely increasing sequence of strictly positive, possibly infinite random variables which are strictly increasing as long as they ...

A simple polyhedron, also called a simplicial polyhedron, is a polyhedron that is topologically equivalent to a sphere (i.e., if it were inflated, it would produce a sphere) ...

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