Search Results for ""

An Eulerian cycle, also called an Eulerian circuit, Euler circuit, Eulerian tour, or Euler tour, is a trail which starts and ends at the same graph vertex. In other words, it ...

Milnor (1956) found more than one smooth structure on the seven-dimensional hypersphere. Generalizations have subsequently been found in other dimensions. Using surgery ...

Given a Poisson distribution with rate of change lambda, the distribution of waiting times between successive changes (with k=0) is D(x) = P(X<=x) (1) = 1-P(X>x) (2) = ...

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

The W polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. (The corresponding w polynomials are called Lucas polynomials.) They have explicit ...

In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a floating-point representation is an unencoded member of a floating-point format which represents either ...

A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...

Ore (1962) noted that not only does a tree possesses a unique shortest path between any two vertices, but that there also exist also other connected graphs having the same ...

Any composite number n with p|(n/p-1) for all prime divisors p of n. n is a Giuga number iff sum_(k=1)^(n-1)k^(phi(n))=-1 (mod n) (1) where phi is the totient function and ...

A plane path on a set of equally spaced lattice points, starting at the origin, where the first step is one unit to the north or south, the second step is two units to the ...