Search Results for ""

A symmetric graph is a graph that is both edge- and vertex-transitive (Holton and Sheehan 1993, p. 209). However, care must be taken with this definition since arc-transitive ...

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

Some authors define a general Airy differential equation as y^('')+/-k^2xy=0. (1) This equation can be solved by series solution using the expansions y = ...

A number n with prime factorization n=product_(i=1)^rp_i^(a_i) is called k-almost prime if it has a sum of exponents sum_(i=1)^(r)a_i=k, i.e., when the prime factor ...

The Archimedean duals are the 13 duals of the 13 Archimedean solids, sometimes called the Catalan solids. They are summarized in the following table and illustrated below ...

The arf invariant is a link invariant that always has the value 0 or 1. A knot has Arf invariant 0 if the knot is "pass equivalent" to the unknot and 1 if it is pass ...

The Bernoulli distribution is a discrete distribution having two possible outcomes labelled by n=0 and n=1 in which n=1 ("success") occurs with probability p and n=0 ...

There are several related series that are known as the binomial series. The most general is (x+a)^nu=sum_(k=0)^infty(nu; k)x^ka^(nu-k), (1) where (nu; k) is a binomial ...

A bitangent is a line that is tangent to a curve at two distinct points. Aa general plane quartic curve has 28 bitangents in the complex projective plane. However, as shown ...

The nth cabtaxi number is the smallest positive number that can be written in n ways as a sum of two (not necessarily positive) cubes. The name derived from the taxicab ...