Search Results for ""

The continuous Fourier transform is defined as f(nu) = F_t[f(t)](nu) (1) = int_(-infty)^inftyf(t)e^(-2piinut)dt. (2) Now consider generalization to the case of a discrete ...

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

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

Pick three points P=(x_1,y_1), Q=(x_2,y_2), and R=(x_3,y_3) distributed independently and uniformly in a unit disk K (i.e., in the interior of the unit circle). Then the ...

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...

The distribution function D(x), also called the cumulative distribution function (CDF) or cumulative frequency function, describes the probability that a variate X takes on a ...

By analogy with the divisor function sigma_1(n), let pi(n)=product_(d|n)d (1) denote the product of the divisors d of n (including n itself). For n=1, 2, ..., the first few ...

A formula for the Bell polynomial and Bell numbers. The general formula states that B_n(x)=e^(-x)sum_(k=0)^infty(k^n)/(k!)x^k, (1) where B_n(x) is a Bell polynomial (Roman ...

Let d_G(k) be the number of dominating sets of size k in a graph G, then the domination polynomial D_G(x) of G in the variable x is defined as ...