Search Results for ""

A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...

Euler conjectured that at least n nth powers are required for n>2 to provide a sum that is itself an nth power. The conjecture was disproved by Lander and Parkin (1967) with ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...

Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...

Enclose a sphere in a cylinder and cut out a spherical segment by slicing twice perpendicularly to the cylinder's axis. Then the lateral surface area of the spherical segment ...

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) ...

Given a regular surface M, an asymptotic curve is formally defined as a curve x(t) on M such that the normal curvature is 0 in the direction x^'(t) for all t in the domain of ...

A parametric latitude which gives a sphere equal surface area relative to an ellipsoid. The authalic latitude is defined by beta=sin^(-1)(q/(q_p)), (1) where ...

An identity in calculus of variations discovered in 1868 by Beltrami. The Euler-Lagrange differential equation is (partialf)/(partialy)-d/(dx)((partialf)/(partialy_x))=0. (1) ...