Search Results for ""

The number of inward directed graph edges from a given graph vertex in a directed graph.

If a graph G has n graph vertices such that every pair of the n graph vertices which are not joined by a graph edge has a sum of valences which is >=n, then G is Hamiltonian. ...

The integral transform (Kf)(x)=int_0^infty((x-t)_+^(c-1))/(Gamma(c))_2F_1(a,b;c;1-t/x)f(t)dt, where Gamma(x) is the gamma function, _2F_1(a,b;c;z) is a hypergeometric ...

Surrogate data are artificially generated data which mimic statistical properties of real data. Isospectral surrogates have identical power spectra as real data but with ...

The number of outward directed graph edges from a given graph vertex in a directed graph.

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

Analytic continuation (sometimes called simply "continuation") provides a way of extending the domain over which a complex function is defined. The most common application is ...

The Mandelbar set is a fractal set analogous to the Mandelbrot set or its generalization to a higher power with the variable z replaced by its complex conjugate z^_.

If p^k is the highest power of a prime p dividing the order of a finite group G, then a subgroup of G of order p^k is called a Sylow p-subgroup of G.

The shortest path-spanning tree from a graph vertex of a graph.