Search Results for ""

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

The compositeness test consisting of the application of Fermat's little theorem.

A loose term for a true statement which may be a postulate, theorem, etc.

A graphical partitioning based on the eigenvalues and eigenvectors of the Laplacian matrix of a graph.

Any continuous function G:B^n->B^n has a fixed point, where B^n={x in R^n:x_1^2+...+x_n^2<=1} is the unit n-ball.

For any M, there exists a t^' such that the sequence n^2+t^', where n=1, 2, ... contains at least M primes.

The ABC (atom-bond connectivity) index of a graph is defined as half the sum of the matrix elements of its ABC matrix. It was introduced by Estrada et al. (2017) to model the ...

The natural norm induced by the L-infty-norm is called the maximum absolute row sum norm and is defined by ||A||_infty=max_(i)sum_(j=1)^n|a_(ij)| for a matrix A. This matrix ...

Let f be a contraction mapping from a closed subset F of a Banach space E into F. Then there exists a unique z in F such that f(z)=z.

If a minimal surface is given by the equation z=f(x,y) and f has continuous first and second partial derivatives for all real x and y, then f is a plane.