Search Results for ""

The disdyakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis dodecahedron. It is implemented in the Wolfram Language as ...

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

The Sobolev embedding theorem is a result in functional analysis which proves that certain Sobolev spaces W^(k,p)(Omega) can be embedded in various spaces including ...

The triakis icosahedral graph is Archimedean dual graph which is the skeleton of the triakis icosahedron. It is implemented in the Wolfram Language as ...

A phenomenological law also called the first digit law, first digit phenomenon, or leading digit phenomenon. Benford's law states that in listings, tables of statistics, ...

The integer sequence defined by the recurrence P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=3, P(1)=0, P(2)=2. This recurrence relation is the same as that for the ...

An elliptic integral is an integral of the form int(A(x)+B(x)sqrt(S(x)))/(C(x)+D(x)sqrt(S(x)))dx, (1) or int(A(x)dx)/(B(x)sqrt(S(x))), (2) where A(x), B(x), C(x), and D(x) ...

The A graph is the graph on 6 vertices illustrated above. Unfortunately, at least one author (Farrugia 1999, p. 2) uses the term "A-graph" to refer to the 5-node bull graph. ...

The banner graph is the (4,1)-tadpole graph illustrated above. It could perhaps also be termed the 'P graph.' It is implemented in the Wolfram Language as ...

The conjugate gradient method is not suitable for nonsymmetric systems because the residual vectors cannot be made orthogonal with short recurrences, as proved in Voevodin ...