Search Results for ""
1091 - 1100 of 13135 for Simple probabilitySearch Results

A chordless cycle of a graph G is a graph cycle in G that has no cycle chord. Unfortunately, there are conflicting conventions on whether or not 3-cycles should be considered ...
The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...
Given relatively prime integers p and q (i.e., (p,q)=1), the Dedekind sum is defined by s(p,q)=sum_(i=1)^q((i/q))(((pi)/q)), (1) where ((x))={x-|_x_|-1/2 x not in Z; 0 x in ...
Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...
A plot of the map winding number W resulting from mode locking as a function of Omega for the circle map theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n) (1) with K=1. (Since ...
Let d_G(k) be the number of dominating sets of size k in a graph G, then the domination polynomial D_G(x) of G in the variable x is defined as ...
If P is a pedal point inside a triangle DeltaABC, and P_A, P_B, and P_C are the feet of the perpendiculars from P upon the respective sides BC, CA, and AB, then ...
The simple continued fraction of the Euler-Mascheroni constant gamma is [0; 1, 1, 2, 1, 2, 1, 4, 3, 13, 5, 1, 1, 8, 1, 2, 4, 1, 1, 40, ...] (OEIS A002852). The first few ...
The Fano plane is the configuration consisting of the two-dimensional finite projective plane over GF(2) ("of order two"), illustrated above. It is a block design with nu=7, ...
The Gauss-Bonnet formula has several formulations. The simplest one expresses the total Gaussian curvature of an embedded triangle in terms of the total geodesic curvature of ...

...