The phrase "a set of disconnected" is correct and usable in written English.
It can be used to describe a collection of items, ideas, or elements that are not related or do not connect logically.
Example: "The report presented a set of disconnected facts that failed to support the main argument."
Alternatives: "a collection of unrelated" or "a group of unconnected".
"It's a set of disconnected facts.
Her own "History of Love" presents at first a set of disconnected puzzle pieces, which the novel proceeds artfully to interlock.
Our model acknowledges the fact that different species require reserves of different sizes, and that these reserves should be compact areas, as opposed to a set of disconnected parcels.
Therefore, each chemical reaction can be represented by one set, or multiple chemically equivalent sets, of atom mappings, each of which may be interpreted as a graph with a set of disconnected edges, each of which establishes a bijective relation between a substrate and product atom (Fig. 1).
All of which points up how lacking we are in what we need most in America, a sense of anticipatory democracy, in which we carry out full and informed debates on future prospects and pitfalls, seeing the playing field of the future as a whole rather than as a set of disconnected happenings that we lurch into and out of in desultory fashion.
Interestingly, if IC is set to zero, we end up with a set of disconnected networks where the level of cooperation will always be lower than if we connect the groups; this can be viewed as a positive reinforcement of cooperation between groups (communities).
We shall assume that (partialvarOmega_) is a closed contour (or a finite set of disconnected closed contours).
Intermittently between 1987 and 1995 he again collaborated with Laurie to produce the popular television program A Bit of Fry and Laurie, in which the duo enacted a set of typically disconnected, although not always unrelated, comical sketches.
It is easy to confirm that a set of vertices disconnects the hypergraph if and only if it disconnects the corresponding simple graph.
This procedure finds a set of h < k vertices that disconnects the input graph, producing several connected components of the graph.
An s-t node separator of G is a set of nodes K ⊆ V whose removal disconnects t from s in G. Figure 2 illustrates this concept.
