This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.1)

GraphDisjointUnion

GraphDisjointUnion
gives the graph disjoint union of the graphs and .
GraphDisjointUnion
gives the disjoint union of , , ....
The graph disjoint union of two graphs:
The graph disjoint union of two graphs:
In[1]:=
Click for copyable input
Out[1]=
GraphDisjointUnion works with undirected graphs:
Directed graphs:
GraphDisjointUnion works with more than two graphs:
The VertexCount of the graph disjoint union is the total of vertex counts for the graphs:
The EdgeCount of the graph disjoint union is the total edges of the graphs:
The graph disjoint union can be found using GraphUnion:
The adjacency matrix for a disjoint union corresponds to the block-diagonal of adjacency matrices:
New in 8