Search Results for ""

An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...

The Mertens function is the summary function M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function (Mertens 1897; Havil 2003, p. 208). The first few values are 1, 0, ...

Orthogonal polynomials are classes of polynomials {p_n(x)} defined over a range [a,b] that obey an orthogonality relation int_a^bw(x)p_m(x)p_n(x)dx=delta_(mn)c_n, (1) where ...

The biconjugate gradient method often displays rather irregular convergence behavior. Moreover, the implicit LU decomposition of the reduced tridiagonal system may not exist, ...

Square triangle picking is the selection of triples of points (corresponding to endpoints of a triangle) randomly placed inside a square. n random triangles can be picked in ...

The Steinmetz solid is the solid common to two (or three) right circular cylinders of equal radii intersecting at right angles is called the Steinmetz solid. Two cylinders ...

There are several differing definitions of the sun graph. ISGCI defines a (complete) n-sun graph as a graph on 2n nodes (sometimes also known as a trampoline graph; ...

The truncated great dodecahedral graph is the skeleton of the small stellated truncated dodecahedron and truncated great dodecahedron. It is illustrated above in a number of ...

A problem posed by the Slovak mathematician Stefan Znám in 1972 asking whether, for all integers k>=2, there exist k integers x_1,...,x_k all greater than 1 such that x_i is ...

Pre-Algebra