Search Results for ""

A topological space that contains a homeomorphic image of every topological space of a certain class. A metric space U is said to be universal for a family of metric spaces M ...

Universality is the property of being able to perform different tasks with the same underlying construction just by being programmed in a different way. Universal systems are ...

A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The upper half-plane is the portion of the complex plane {x+iy:x,y in (-infty,infty)} satisfying y=I[z]>0 i.e., {x+iy:x in (-infty,infty),y in (0,infty)}. Common notations ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

An urelement contains no elements, belongs to some set, and is not identical with the empty set (Moore 1982, p. 3; Rubin 1967, p. 23). "Ur" is a German prefix which is ...

A characterization of normal spaces which states that a topological space X is normal iff, for any two nonempty closed disjoint subsets A, and B of X, there is a continuous ...

The (m,q)-Ustimenko graph is the distance-1 or distance-2 graph of the dual polar graph on [C_m(q)] (Brouwer et al. 1989, p. 279). The Ustimenko graph with parameters m and q ...

The validity of a logical argument refers to whether or not the conclusion follows logically from the premises, i.e., whether it is possible to deduce the conclusion from the ...