Search Results for ""

A spectrum formed by the Lagrange numbers. The only ones less than three are the Lagrange numbers, but the last gaps end at Freiman's constant. Real numbers larger than ...

A lattice which is built up of layers of n-dimensional lattices in (n+1)-dimensional space. The vectors specifying how layers are stacked are called glue vectors. The order ...

The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...

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

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...

The number of outward directed graph edges from a given graph vertex in a directed graph.

A commutative unit ring having only finitely many maximal ideals.

A Cantor set C in R^3 is said to be scrawny if for each neighborhood U of an arbitrary point p in C, there is a neighborhood V of p such that every map f:S^1->V subset C ...

A morphism f:X->Y is said to be separable if K(X) is a separable extension of K(Y).

A function f(x) is said to be square integrable if int_(-infty)^infty|f(x)|^2dx is finite.