Search Results for ""

A finitely generated discontinuous group of linear fractional transformations z->(az+b)/(cz+d) acting on a domain in the complex plane. The Apollonian gasket corresponds to a ...

Given a sum and a set of weights, find the weights which were used to generate the sum. The values of the weights are then encrypted in the sum. This system relies on the ...

The König-Egeváry theorem, sometimes simply called König's theorem, asserts that the matching number (i.e., size of a maximum independent edge set) is equal to the vertex ...

König's line coloring theorem states that the edge chromatic number of any bipartite graph equals its maximum vertex degree. In other words, every bipartite graph is a class ...

A theorem which plays a fundamental role in computer science because it is one of the main tools for showing that certain orderings on trees are well-founded. These orderings ...

For every positive integer n, there exists a sphere which has exactly n lattice points on its surface. The sphere is given by the equation ...

The Kuratowski reduction theorem states that very nonplanar graph contains either the utility graph UG=K_(3,3) or the pentatope graph K_5 as a graph minor. The graphs K_(3,3) ...

The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix. The second smallest root of the Laplacian polynomial of a graph g (counting multiple values ...

The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...

A path composed of connected horizontal and vertical line segments, each passing between adjacent lattice points. A lattice path is therefore a sequence of points P_0, P_1, ...