Search Results for ""

The maximum degree, sometimes simply called the maximum degree, of a graph G is the largest vertex degree of G, denoted Delta.

In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...

The second-order ordinary differential equation y^('')+alpha(x)y^'+x^2y^n=0.

A function f(x) is said to be nondecreasing on an interval I if f(b)>=f(a) for all b>a, where a,b in I. Conversely, a function f(x) is said to be nonincreasing on an interval ...

A quantity which is either 0 (zero) or negative, i.e., <=0.

A multiple of 2. The word should really be something like "bicade" (by analogy with decade) but the "oct" embedded in the stem of the word derives historically to the fact ...

A nonsingular linear map A:R^n->R^n is orientation-preserving if det(A)>0.

A quadratic surface given by the equation x^2+2rz=0.

An edge of a graph is said to be pendant if one of its vertices is a pendant vertex.

The term "polyedge" has been variously proposed to refer to a polystick or a simple connected graph on n edges (Muñiz 2011), the latter of which has also been termed an ...