Search Results for ""

Assume that n numbered pancakes are stacked, and that a spatula can be used to reverse the order of the top k pancakes for 2<=k<=n. Then the pancake sorting problem asks how ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...

A convex planar domain in which the minimal generalized diameter is >1 always contains a circle of radius 1/3.

Given a triangle DeltaA_1A_2A_3, the points A_1, I, and J_1 lie on a line, where I is the incenter and J_1 is the excenter corresponding to A_1. Furthermore, the circle with ...

The geometric span is largest possible distance between two points drawn from a finite set of points. It is therefore closely related to the generalized diameter of a closed ...

The Loupekine snarks are the two snarks on 22 vertices and 33 edges illustrated above. They are implemented in the Wolfram Language as GraphData["LoupekineSnark1"] and ...

The moment of inertia with respect to a given axis of a solid body with density rho(r) is defined by the volume integral I=intrho(r)r__|_^2dV, (1) where r__|_ is the ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.

The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...