Search Results for ""

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

Krasner's lemma states that if K a complete field with valuation v, K^_ is a fixed algebraic closure of K together with the canonical extension of v, and K^_^^ is its ...

A limb of a tree at a vertex v is the union of one or more branches at v in the tree. v is then called the base of the limb.

Two or more functions, equations, or vectors f_1, f_2, ..., which are not linearly dependent, i.e., cannot be expressed in the form a_1f_1+a_2f_2+...+a_nf_n=0 with a_1, a_2, ...

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 ...

A tree not having the complete bipartite graph K_(1,2) with base at the vertex of degree two as a limb (Lu et al. 1993, Lu 1996).

The mean clustering coefficient of a graph G is the average of the local clustering coefficients of G. It is implemented in the Wolfram Language as ...

The dual of the snub dodecadodecahedron U_(40) and Wenninger dual W_(111).

Let R be a plane region bounded above by a continuous curve y=f(x), below by the x-axis, and on the left and right by x=a and x=b, then the volume of the solid of revolution ...

A problem is NP-hard if an algorithm for solving it can be translated into one for solving any NP-problem (nondeterministic polynomial time) problem. NP-hard therefore means ...