Search Results for ""

In most modern literature, a Boolean model is a probabilistic model of continuum percolation theory characterized by the existence of a stationary point process X and a ...

A complete oriented graph (Skiena 1990, p. 175), i.e., a graph in which every pair of nodes is connected by a single uniquely directed edge. The first and second 3-node ...

A Barker code is a string of digits a_i=+/-1 of length l>=2 such that |sum_(i=1)^(l-k)a_ia_(i+k)|<=1 for all 1<=k<l. Barker codes are used for pulse compression of radar ...

Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

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

The sequence of numbers {j_n} giving the number of digits in the three-fold power tower n^(n^n). The values of n^(n^n) for n=1, 2, ... are 1, 16, 7625597484987, ... (OEIS ...

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

The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...