Disjoint union of graphs
Binary operation combining the vertex and edge sets of two graphs
Disjoint union of graphs
In graph theory, 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.
Read on Wikipedia · Image Rinke 80, Public domain
Open boosters, collect cards and trade them. Free to play.
Play for free