disjoint union

(redirected from Disjoint unions)

disjoint union

In domain theory, a union (or sum) which results in a domain without a least element.
References in periodicals archive ?
k] be the full subposet of O whose objects are disjoint unions of at most k components, each diffeomorphic to [R.
k](M) contains all open sets which are disjoint unions of at most k open balls (in the euclidean metric sense).
Batle On edge-magic labelings of certain disjoint unions of graphs Australas.
an ) to denote the disjoint union of the n stars St(a1) St(a2) .
all possible disjoint unions of these magnitudes, all possible disjoint unions of disjoint unions of the same magnitudes, and so on.
Muntaner-Batle, On edge-magic labelings of certain disjoint unions of graphs, Austral.
In this paper, we investigate the existence of super d-antimagic labelings of type (1,1,0) for disjoint union of plane graphs for several values of difference d.
The product of a matrix by a vector or by a matrix is obtained by the classical formulas in sums of products forms, sums being interpreted as disjoint unions and products as cartesian products, themselves obtained by grafting at a bud following Eq.
There exists a notion which is halfway between that of simple and that of arbitrary disjoint unions of simple sets.
The graph G' is constructed from the disjoint union of [S.
2]) [union] {(u, v) [member of] V(G): u [member of] C(i), [upsilon] [member of] C(j)}, which connects in the disjoint union all vertices in C(i) with all vertices in C(j).
r,k] be the family of r-regular graphs H whose vertex set is the disjoint union [F.