Search Results for ""

A noncayley graph is a graph which is not a Cayley graph. All graphs that are not vertex-transitive are noncayley graphs. However, some vertex-transitive graph are noncayley. ...

The concept of "random close packing" was shown by Torquato et al. (2000) to be mathematically ill-defined idea that is better replaced by the notion of "maximally random ...

The triangle DeltaA^*B^*C^* obtained by reflecting the vertices of a reference triangle DeltaABC about the opposite sides is called the reflection triangle (Grinberg 2003). ...

Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

The combining of two or more quantities using the plus operator. The individual numbers being combined are called addends, and the total is called the sum. The first of ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

Because even high-resolution computer monitors have a relatively small number of pixels, when graphics or text display distinguish between individual pixels. The result is ...

The associated Legendre differential equation is a generalization of the Legendre differential equation given by d/(dx)[(1-x^2)(dy)/(dx)]+[l(l+1)-(m^2)/(1-x^2)]y=0, (1) which ...

The surface which is the inverse of the ellipsoid in the sense that it "goes in" where the ellipsoid "goes out." It is given by the parametric equations x = acos^3ucos^3v (1) ...