Search Results for ""

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

The doubly truncated Witt graph is the graph on 330 vertices related to a 3-(22,8,12) design (Brouwer et al. 1989, p. 367). The doubly truncated Witt graph can be constructed ...

Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent (Harary 1994), so that one may speak of ...

An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. More precisely, a graph is edge-transitive if for all ...

The Eiffel Tower graph is the graph on 7 vertices illustrated above. (Note that Koren et al. (2003) use the term 'Eiffel Tower graph' to refer instead to the (3,2)-fan ...

Let the elliptic modulus k satisfy 0<k^2<1, and the Jacobi amplitude be given by phi=amu with -pi/2<phi<pi/2. The incomplete elliptic integral of the first kind is then ...

Let the elliptic modulus k satisfy 0<k^2<1. (This may also be written in terms of the parameter m=k^2 or modular angle alpha=sin^(-1)k.) The incomplete elliptic integral of ...

The elliptic lambda function lambda(tau) is a lambda-modular function defined on the upper half-plane by lambda(tau)=(theta_2^4(0,q))/(theta_3^4(0,q)), (1) where tau is the ...

The terms of equational logic are built up from variables and constants using function symbols (or operations). Identities (equalities) of the form s=t, (1) where s and t are ...

If A=>B and B=>A (i.e., A=>B ^ B=>A, where => denotes implies), then A and B are said to be equivalent, a relationship which is written symbolically in this work as A=B. The ...