GraphTheory[GraphJoin]
|
Calling Sequence
|
|
GraphJoin(G, H)
|
|
Description
|
|
•
|
The GraphJoin(G,H) function returns the graph which is obtained by connecting all the vertices of G to all vertices of H. The vertex labels in the resulting graph are strings of the form "1:u" and "2:v" where u is a vertex in G and v is a vertex in H.
|
|
|
Examples
|
|
>
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
|
|
Download Help Document
Was this information helpful?