2.2.1. Union of graphs
The union of two graphs has
and
. If a graph consists of k disjoint
copies of a graph H, then we write
.
Figure 2.4. Union of 3K1 U K3 U K2,2
2.2.1. Union of graphs
The union of two graphs has
and
. If a graph consists of k disjoint
copies of a graph H, then we write
.
Figure 2.4. Union of 3K1 U K3 U K2,2