Loading AI tools
Combining the vertex and edge sets of two graphs From Wikipedia, the free encyclopedia
In graph theory, a branch of mathematics, the disjoint union of graphs is an operation that combines two or more graphs to form a larger graph. It is analogous to the disjoint union of sets, and is constructed by making the vertex set of the result be the disjoint union of the vertex sets of the given graphs, and by making the edge set of the result be the disjoint union of the edge sets of the given graphs. Any disjoint union of two or more nonempty graphs is necessarily disconnected.
The disjoint union is also called the graph sum, and may be represented either by a plus sign or a circled plus sign: If and are two graphs, then or denotes their disjoint union.[1]
Certain special classes of graphs may be represented using disjoint union operations. In particular:
More generally, every graph is the disjoint union of connected graphs, its connected components.
The cographs are the graphs that can be constructed from single-vertex graphs by a combination of disjoint union and complement operations.[5]
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.
