Search Results for ""

A cycle double cover of an undirected graph is a collection of cycles that cover each edge of the graph exactly twice. For a polyhedral graph, the faces of a corresponding ...

A shortest path between two graph vertices (u,v) of a graph (Skiena 1990, p. 225). There may be more than one different shortest paths, all of the same length. Graph ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

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

A confidence interval is an interval in which a measurement or trial falls corresponding to a given probability. Usually, the confidence interval of interest is symmetrically ...

An exponential moving average, also known as an exponentially weighted moving average and abbreviated EMA or EWMA, is a moving filter that applied weights to older values in ...

A differential k-form can be integrated on an n-dimensional manifold. The basic example is an n-form alpha in the open unit ball in R^n. Since alpha is a top-dimensional ...

Given a smooth manifold M with an open cover U_i, a partition of unity subject to the cover U_i is a collection of smooth, nonnegative functions psi_i, such that the support ...

Series expansions of the parabolic cylinder functions U(a,x) and W(a,x). The formulas can be found in Abramowitz and Stegun (1972).