Search Results for ""

A total order (or "totally ordered set," or "linearly ordered set") is a set plus a relation on the set (called a total order) that satisfies the conditions for a partial ...

Given a complex measure mu, there exists a positive measure denoted |mu| which measures the total variation of mu, also sometimes called simply "total variation." In ...

If one part of the total intersection group of a curve of order n with a curve of order n_1+n_2 constitutes the total intersection with a curve of order n_1, then the other ...

A minimum clique covering is a clique covering of minimum size, and the size of such a minimum clique covering is known as the clique covering number. Note that while a ...

The term "total curvature" is used in two different ways in differential geometry. The total curvature, also called the third curvature, of a space curve with line elements ...

The minimum vertex degree, sometimes simply called the minimum degree, of a graph G is the smallest vertex degree of G, denoted delta.

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

A ring of fractions that coincides with the localization with respect to the set of all non-zero divisors.

The concept of irredundance was introduced by Cockayne et al. (1978). Let N_G[v] denote the graph neighborhood of a vertex v in a graph G (including v itself), and let N_G[S] ...