Search Results for ""

Let ||f|| be the supremum of |f(x)|, a real-valued function f defined on (0,infty). If f is twice differentiable and both f and f^('') are bounded, Landau (1913) showed that ...

The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...

Operations research is a vast branch of mathematics which encompasses many diverse areas of minimization and optimization. Thousands of books have been written worldwide on ...

The pentakis icosidodecahedral graph, illustrated above, is a graph on 42 vertices that is the skeleton of the pentakis icosidodecahedron.

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

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...

A Turán graph, sometimes called a maximally saturated graph (Zykov 1952, Chao and Novacky 1982), with positive integer parameters n and k is a type of extremal graph on n ...

The nth k-statistic k_n is the unique symmetric unbiased estimator of the cumulant kappa_n of a given statistical distribution, i.e., k_n is defined so that <k_n>=kappa_n, ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...