Wolfram Mathematica Documentation Center
DOCUMENTATION CENTER SEARCH
New to Mathematica? Find your learning path »
Mathematica > Mathematics and Algorithms > Graphs & Networks > Graph Operations and Modifications > GraphDisjointUnion >
Mathematica > Visualization and Graphics > Graphs & Networks > Graph Operations and Modifications > GraphDisjointUnion >
Mathematica > Mathematics and Algorithms > Graphs & Networks > Constructing Graphs > Graph Operations and Modifications > GraphDisjointUnion >
BUILT-IN MATHEMATICA SYMBOLSee Also »|More About »

GraphDisjointUnion

GraphDisjointUnion
gives the graph disjoint union of the graphs and .
GraphDisjointUnion
gives the disjoint union of , , ....
MORE INFORMATION
EXAMPLESCLOSE ALL
Basic Examples   (1)
The graph disjoint union of two graphs:
The graph disjoint union of two graphs:
In[1]:=
Click for copyable input
Out[1]=
Scope   (3)
GraphDisjointUnion works with undirected graphs:
Directed graphs:
GraphDisjointUnion works with more than two graphs:
Properties & Relations   (4)
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
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF