Search Results for ""

A siteswap is a sequence encountered in juggling in which each term is a positive integer, encoded in binary. The transition rule from one term to the next consists of ...

To color any map on the sphere or the plane requires at most six-colors. This number can easily be reduced to five, and the four-color theorem demonstrates that the necessary ...

In algebraic topology, a p-skeleton is a simplicial subcomplex of K that is the collection of all simplices of K of dimension at most p, denoted K^((p)). The graph obtained ...

Twenty golfers wish to play in foursomes for 5 days. Is it possible for each golfer to play no more than once with any other golfer? The answer is yes, and the following ...

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

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

Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...