Search Results for ""

A polyhedral nonhamiltonian graph is a graph that is simultaneously polyhedral and nonhamiltonian. The smallest possible number of vertices a nonhamiltonian polyhedral graph ...

Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...

Presburger arithmetic is the first-order theory of the natural numbers containing addition but no multiplication. It is therefore not as powerful as Peano arithmetic. ...

Let p_n be the nth prime, then the primorial (which is the analog of the usual factorial for prime numbers) is defined by p_n#=product_(k=1)^np_k. (1) The values of p_n# for ...

For some authors (e.g., Bourbaki, 1964), the same as principal ideal domain. Most authors, however, do not require the ring to be an integral domain, and define a principal ...

The probability density function (PDF) P(x) of a continuous distribution is defined as the derivative of the (cumulative) distribution function D(x), D^'(x) = ...

A projection matrix P is an n×n square matrix that gives a vector space projection from R^n to a subspace W. The columns of P are the projections of the standard basis ...

The wave equation in prolate spheroidal coordinates is del ...

A quartic symmetric graph is a symmetric graph that is also quartic (i.e., regular of degree 4). The numbers of symmetric quartic graphs on n=1, 2, ... are 0, 0, 0, 0, 1, 1, ...

Quasi-Monte Carlo integration is a method of numerical integration that operates in the same way as Monte Carlo integration, but instead uses sequences of quasirandom numbers ...