| Part of Speech | Definition | |
| Adverb | 1. In a disjointed state.[Websters]
2. In a separate, distributive, unconnected or abstract manner. [Eve - graph theoretic] 3. In a joint manner. [Eve - graph theoretic] 4. Rarely used adverbial inflection of the adjective disjoint.[Eve - graph theoretic] | |
| Adjective Form (disjoint) | 1. Having no elements in common.[Wordnet]. 2. Disjointed; unconnected; -- opposed to conjoint.[Websters]. 3. Being separate, detached, discrete or isolated.[Eve - graph theoretic] 4. Being joint.[Eve - graph theoretic] 5. Being articulate.[Eve - graph theoretic] 6. Adjective base of the adverb disjointly.[Eve - graph theoretic] | |
Source: Webster's Revised Unabridged Dictionary (1913), compiled from various sources, under license. | Top | |
Date "DISJOINTLY" was first used in popular English literature: sometime before 1828. (references) |
Specialty Definition: DISJOINTLY
| Domain | Definition | ||
| Noah Webster | [Adverb] In a divided state. Source: Webster's 1828 American Dictionary. | ||
Source: compiled by the editor from various references; see credits. | Top | ||
Common Expressions: disjoint
| Expressions | Definition | ||
| Almost disjoint sets | In mathematics, two sets are almost disjoint if their intersection is small in some sense. Different definitions of "small" will therefore result in different definitions of "almost disjoint". (references) | ||
| Disjoint union | In set theory, a disjoint union (or discriminated union) is a union of a collection of sets whose members are pairwise disjoint. (references) | ||
| Disjoint union (topology) | In topology and related areas of mathematics, the disjoint union (also called the direct sum, free union, or coproduct) of a family of topological spaces is a space formed by equipping the disjoint union of the underlying sets with a natural topology called the disjoint union topology. (references) | ||
Source: compiled by the editor from various references; see credits. | Top | ||
Specialty Expressions: disjoint
| Expressions | Domain | Definition | |
| Disjoint set | Math | A set whose members do not overlap, are not duplicated, etc. (references) | |
| Disjoint union | Computing | Disjoint union In domain theory, a union (or sum) which results in a domain without a least element. Source: The Free On-line Dictionary of Computing.. | |
Source: compiled by the editor from various references; see credits. | Top | ||
Topics by Level of Interest: disjoint | ||||
| Topics sorted by level of Interest | Level (1=low, 600=high) | Topics sorted Alphabetically | Level (1=low, 600=high) | |
| Disjoint | 18 | Almost disjoint sets | 6 | |
| Disjoint union | 12 | Disjoint | 18 | |
| Disjoint union (topology) | 7 | Disjoint sets | 4 | |
| Almost disjoint sets | 6 | Disjoint union | 12 | |
| Disjoint sets | 4 | Disjoint union (topology) | 7 | |
| Edge disjoint shortest pair algorithm | 3 | Edge disjoint shortest pair algorithm | 3 | |
Source: the editor, created by/for EVE to gauge likely levels of human interest in linguistically triggered topics (compiled across various sources, such as Wikipedia and specialty expression glosses). | ||||
