Search Results for ""

A function which is not defined explicitly, but rather is defined in terms of an algebraic relationship (which can not, in general, be "solved" for the function in question). ...

An induced subgraph is a subgraph obtained from an original graph by removing a subset of vertices and/or edges together with any edges whose endpoints are both in this ...

One petabyte is 10^(15) bytes. Unfortunately, the term is sometimes also used to mean 2^(50)=1024^5 bytes. However, the latter usage is deprecated, and the term pebibyte is ...

A relation is any subset of a Cartesian product. For instance, a subset of A×B, called a "binary relation from A to B," is a collection of ordered pairs (a,b) with first ...

One trillion (10^(12)) bytes. Unfortunately, the term is sometimes also used to mean 2^(40)=1024^4=1099511627776 bytes. However, this usage is deprecated, and the term ...

Let m>=3 be an integer and let f(x)=sum_(k=0)^na_kx^(n-k) be an integer polynomial that has at least one real root. Then f(x) has infinitely many prime divisors that are not ...

The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix. The second smallest root of the Laplacian polynomial of a graph g (counting multiple values ...

The tetranacci constant is ratio to which adjacent tetranacci numbers tend, and is given by T = (x^4-x^3-x^2-x-1)_2 (1) = 1.92756... (2) (OEIS A086088), where (P(x))_n ...

The height of a tree g is defined as the vertex height of its root vertex, where the vertex height of a vertex v in a tree g is the number of edges on the longest downward ...

The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...