Rare card
Disjoint union of graphs
- Value
- 50 W
- Attack
- 756
- Defence
- 605
- Players
- 0
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…
Get Disjoint union of graphs in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack