Search Results for ""

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...

The Soicher graphs are three distance-regular graphs on 5346, 486, and 315 vertices, respectively. The first two are also distance-transitive but the third is not. The second ...

A cubic map is three-colorable iff each interior region is bounded by an even number of regions. A non-cubic map bounded by an even number of regions is not necessarily ...

A matrix for a round-robin tournament involving n players competing in n(n-1)/2 matches (no ties allowed) having entries a_(ij)={1 if player i defeats player j; -1 if player ...

A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...

For some constant alpha_0, alpha(f,z)<alpha_0 implies that z is an approximate zero of f, where alpha(f,z)=(|f(z)|)/(|f^'(z)|)sup_(k>1)|(f^((k))(z))/(k!f^'(z))|^(1/(k-1)). ...

Define the correlation integral as C(epsilon)=lim_(N->infty)1/(N^2)sum_(i,j=1; i!=j)^inftyH(epsilon-|x_i-x_j|), (1) where H is the Heaviside step function. When the below ...

The science of adversarial information protection.

An equation of the form y=ax^3+bx^2+cx+d, (1) where the three roots of the equation coincide (and are therefore real), i.e., y=a(x-r)^3=a(x^3-3rx^2-3r^2x-r^3). (2) Loomis ...

The polar curve r=1+2cos(2theta) (1) that can be used for angle trisection. It was devised by Ceva in 1699, who termed it the cycloidum anomalarum (Loomis 1968, p. 29). It ...