Search Results for ""

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...

Let a piecewise smooth function f with only finitely many discontinuities (which are all jumps) be defined on [-pi,pi] with Fourier series a_k = 1/piint_(-pi)^pif(t)cos(kt)dt ...

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

Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...

Informally, an elliptic curve is a type of cubic curve whose solutions are confined to a region of space that is topologically equivalent to a torus. The Weierstrass elliptic ...

Convergents of the pi continued fractions are the simplest approximants to pi. The first few are given by 3, 22/7, 333/106, 355/113, 103993/33102, 104348/33215, ... (OEIS ...

The Fourier transform is a generalization of the complex Fourier series in the limit as L->infty. Replace the discrete A_n with the continuous F(k)dk while letting n/L->k. ...

The molecular topological index is a graph index defined by MTI=sum_(i=1)^nE_i, where E_i are the components of the vector E=(A+D)d, with A the adjacency matrix, D the graph ...

The Barnes G-function is an analytic continuation of the G-function defined in the construction of the Glaisher-Kinkelin constant G(n)=([Gamma(n)]^(n-1))/(H(n-1)) (1) for ...

The simplest dissection of a square into rectangles of the same areas but different shapes, composed of the seven pieces illustrated above. The square is 210 units on a side, ...