Search Results for ""

A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...

Denote the nth derivative D^n and the n-fold integral D^(-n). Then D^(-1)f(t)=int_0^tf(xi)dxi. (1) Now, if the equation D^(-n)f(t)=1/((n-1)!)int_0^t(t-xi)^(n-1)f(xi)dxi (2) ...

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...

Hypothesis testing is the use of statistics to determine the probability that a given hypothesis is true. The usual process of hypothesis testing consists of four steps. 1. ...

Lauricella functions are generalizations of the Gauss hypergeometric functions to multiple variables. Four such generalizations were investigated by Lauricella (1893), and ...

Let n>1 be any integer and let lpf(n) (also denoted LD(n)) be the least integer greater than 1 that divides n, i.e., the number p_1 in the factorization ...

A generalization of calculus of variations which draws the relationship between the stationary points of a smooth real-valued function on a manifold and the global topology ...

The multicomputational paradigm is a generalization of the computational paradigm to many computational threads of time. In the ordinary computational paradigm, time ...