Search Results for ""

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

Hadamard's maximum determinant problem asks to find the largest possible determinant (in absolute value) for any n×n matrix whose elements are taken from some set. Hadamard ...

Let P(G) denote the chromatic polynomial of a finite simple graph G. Then G is said to be chromatically unique if P(G)=P(H) implies that G and H are isomorphic graphs, in ...

A Halin graph, sometimes known as a roofless polyhedron, is a polyhedral graph constructed from a planar embedding of a tree having four or more vertices, no vertices of ...

The quantities obtained from cubic, hexagonal, etc., lattice sums, evaluated at s=1, are called Madelung constants. For cubic lattice sums ...

The simple continued fraction representations of e given by [2; 1, 2, 1, 1, 4, 1, 1, 6, ...] (OEIS A003417). This continued fraction is sometimes known as Euler's continued ...

The function defined by chi_nu(z)=sum_(k=0)^infty(z^(2k+1))/((2k+1)^nu). (1) It is related to the polylogarithm by chi_nu(z) = 1/2[Li_nu(z)-Li_nu(-z)] (2) = ...

An antimagic square is an n×n array of integers from 1 to n^2 such that each row, column, and main diagonal produces a different sum such that these sums form a sequence of ...

An official chessboard is an 8×8 board containing squares alternating in color between olive green and buff (where "buff" is a color variously defined as a moderate orange ...

The numerical value of Khinchin's constant K is given by K=2.685452001... (OEIS A002210). However, the numerical value of K is notoriously difficult to calculate to high ...