Search Results for ""

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

The Delannoy numbers D(a,b) are the number of lattice paths from (0,0) to (b,a) in which only east (1, 0), north (0, 1), and northeast (1, 1) steps are allowed (i.e., ->, ^, ...

The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the ...

A graph embedding, sometimes also called a graph drawing, is a particular drawing of a graph. Graph embeddings are most commonly drawn in the plane, but may also be ...

The mathematical study of the properties of the formal mathematical structures called graphs.

A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...

LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...

Let n be a positive number having primitive roots. If g is a primitive root of n, then the numbers 1, g, g^2, ..., g^(phi(n)-1) form a reduced residue system modulo n, where ...

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...