Search Results for ""

An algorithm which can be used to find a good, but not necessarily minimal, edge or vertex coloring for a graph. However, the algorithm does minimally color complete ...

Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...

An n-bridge knot is a knot with bridge number n. The set of 2-bridge knots is identical to the set of rational knots. If L is a 2-bridge knot, then the BLM/Ho polynomial Q ...

The least number of unknotted arcs lying above the plane in any projection. The knot 05-002 has bridge number 2. Such knots are called 2-bridge knots. There is a one-to-one ...

A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...

A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...

The area of the shadow of a body on a plane, also called the "outer quermass."

A Tschirnhausen transformation can be used to algebraically transform a general quintic equation to the form z^5+c_1z+c_0=0. (1) In practice, the general quintic is first ...

A Tschirnhausen transformation can be used to take a general quintic equation to the form x^5-x-a=0, where a may be complex.

Using a Tschirnhausen transformation, the principal quintic form can be transformed to the one-parameter form w^5-10cw^3+45c^2w-c^2=0 (1) named after Francesco Brioschi ...