Search Results for ""

The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

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

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.

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...

The improvement of the convergence properties of a series, also called convergence acceleration or accelerated convergence, such that a series reaches its limit to within ...

An automorphism is an isomorphism of a system of objects onto itself. The term derives from the Greek prefix alphaupsilontauomicron (auto) "self" and ...

Let P be the set of prime ideals of a commutative ring A. Then an affine scheme is a technical mathematical object defined as the ring spectrum sigma(A) of P, regarded as a ...

Let V be a vector space over a field K, and let A be a nonempty set. Now define addition p+a in A for any vector a in V and element p in A subject to the conditions: 1. ...

Let K be a field, and A a K-algebra. Elements y_1, ..., y_n are algebraically independent over K if the natural surjection K[Y_1,...,Y_n]->K[y_1,...,y_n] is an isomorphism. ...