Search Results for ""

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

A graph that is not finite is called infinite.

The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.

The Ionin-Kharaghani graph is a strongly regular graph on 765 vertices and 73440 edges. It has regular parameters (nu,k,lambda,mu)=(765,192,48,48). It is implemented in the ...

If p divides the numerator of the Bernoulli number B_(2k) for 0<2k<p-1, then (p,2k) is called an irregular pair. For p<30000, the irregular pairs of various forms are p=16843 ...

The repeated application of a transformation.

Let W(u) be a Wiener process. Then where V_t=f(W(t),tau) for 0<=tau=T-t<=T, and f in C^(2,1)((0,infty)×[0,T]). Note that while Ito's lemma was proved by Kiyoshi Ito (also ...

Given a convex plane region with area A and perimeter p, then |N-A|<p, where N is the number of enclosed lattice points.

The throwing and catching of multiple objects such that at least one is always in the air. Some aspects of juggling turn out to be quite mathematical. The best examples are ...

The security of a cryptosystem must not depend on keeping the cryptographic algorithm secret.