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.
G≔Graph 1: an undirected unweighted graph with 5 vertices and 7 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)