Search Results for ""

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...

A planar straight line embedding of a planar graph is a planar embedding in which only straight line segments are used to connect the graph vertices. Fáry (1948) showed that ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...

Taking a connected graph or network with a high graph diameter and adding a very small number of edges randomly, the diameter tends to drop drastically. This is known as the ...

The asymptotic series for the gamma function is given by (1) (OEIS A001163 and A001164). The coefficient a_n of z^(-n) can given explicitly by ...

The mean tetrahedron volume of a tetrahedron with vertices chosen at random inside another tetrahedron of unit volume is given by V^_ = (13)/(720)-(pi^2)/(15015) (1) = ...

A Pierpont prime is a prime number of the form p=2^k·3^l+1. The first few Pierpont primes are 2, 3, 5, 7, 13, 17, 19, 37, 73, 97, 109, 163, 193, 257, 433, 487, 577, 769, ... ...

"Analysis of Variance." A statistical test for heterogeneity of means by analysis of group variances. ANOVA is implemented as ANOVA[data] in the Wolfram Language package ...

Given a Taylor series f(z)=sum_(n=0)^inftyC_nz^n=sum_(n=0)^inftyC_nr^ne^(intheta), (1) where the complex number z has been written in the polar form z=re^(itheta), examine ...