Search Results for ""

In the American system, 10^(33).

If q is logically deducible from p, this is written p|-q.

A matrix whose eigenvectors are not complete.

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...

A polynomial form which is the sum of two polynomial forms involving separate sets of variables.

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

If lim_(k->infty)u_k!=0, then the series {u_n} diverges.

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

Distinguish between smooth manifolds in four dimensions.

In the American system, 10^(39).