Search Results for ""

The Laplacian for a scalar function phi is a scalar differential operator defined by (1) where the h_i are the scale factors of the coordinate system (Weinberg 1972, p. 109; ...

The standard Lorentzian inner product on R^4 is given by -dx_0^2+dx_1^2+dx_2^2+dx_3^2, (1) i.e., for vectors v=(v_0,v_1,v_2,v_3) and w=(w_0,w_1,w_2,w_3), ...

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...

In the mice problem, also called the beetle problem, n mice start at the corners of a regular n-gon of unit side length, each heading towards its closest neighboring mouse in ...

There are certain optimization problems that become unmanageable using combinatorial methods as the number of objects becomes large. A typical example is the traveling ...

Taking a connected graph or network with a high graph diameter and adding a very small number of edges randomly, the diameter tends to drop drastically. This is known as the ...

Surface area is the area of a given surface. Roughly speaking, it is the "amount" of a surface (i.e., it is proportional to the amount of paint needed to cover it), and has ...

The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n ...

There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...

The Zernike polynomials are a set of orthogonal polynomials that arise in the expansion of a wavefront function for optical systems with circular pupils. The odd and even ...