Search Results for ""

An edge cover is a subset of edges defined similarly to the vertex cover (Skiena 1990, p. 219), namely a collection of graph edges such that the union of edge endpoints ...

Flat polygons embedded in three-space can be transformed into a congruent planar polygon as follows. First, translate the starting vertex to (0, 0, 0) by subtracting it from ...

The subset B of the Euclidean plane formed by the union of the interval [0,1] of the x-axis and all line segments of unit length passing through the origin which form an ...

The Hoffman-Singleton graph is the graph on 50 nodes and 175 edges that is the only regular graph of vertex degree 7, diameter 2, and girth 5. It is the unique (7,5)-cage ...

An apex graph is a graph possessing at least one vertex whose removal results in a planar graph. The set of vertices whose removal results in a planar graph is known as the ...

A pair (M,omega), where M is a manifold and omega is a symplectic form on M. The phase space R^(2n)=R^n×R^n is a symplectic manifold. Near every point on a symplectic ...

A mathematical object invented to solve irreducible congruences of the form F(x)=0 (mod p), where p is prime.

A spherical harmonic of the form sin(mphi)P_m^m(costheta) or cos(mphi)P_m^m(costheta).

A long division in which most or all of the digits are replaced by a symbol (usually asterisks) to form a cryptarithmetic.

The Pasch graph is the Levi graph of the Pasch configuration. The Pasch graph is edge-transitive but not vertex-transitive, but fails to be semisymmetric since it is not ...