Search Results for ""

The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...

The dimension e(G), also called the Euclidean dimension (e.g., Buckley and Harary 1988) of a graph, is the smallest dimension n of Euclidean n-space in which G can be ...

A sequence {a_n}_(n=1)^N forms a (binary) heap if it satisfies a_(|_j/2_|)<=a_j for 2<=j<=N, where |_x_| is the floor function, which is equivalent to a_i<a_(2i) and ...

Let there be n ways for a "good" selection and m ways for a "bad" selection out of a total of n+m possibilities. Take N samples and let x_i equal 1 if selection i is ...

An injective module is the dual notion to the projective module. A module M over a unit ring R is called injective iff whenever M is contained as a submodule in a module N, ...

A branch of mathematics which brings together ideas from algebraic geometry, linear algebra, and number theory. In general, there are two main types of K-theory: topological ...

A Kähler structure on a complex manifold M combines a Riemannian metric on the underlying real manifold with the complex structure. Such a structure brings together geometry ...

In combinatorial logic minimization, a device known as a Karnaugh map is frequently used. It is similar to a truth table, but the various variables are represented along two ...

A Lorentz transformation is a four-dimensional transformation x^('mu)=Lambda^mu_nux^nu, (1) satisfied by all four-vectors x^nu, where Lambda^mu_nu is a so-called Lorentz ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...