Operations on graphs including union, intersection, difference, complement, subgraph.
| cartesian_product(G, H[, create_using]) | Return the Cartesian product of G and H. |
| compose(G, H[, create_using, name]) | Return a new graph of G composed with H. |
| complement(G[, create_using, name]) | Return graph complement of G. |
| union(G, H[, create_using, rename, name]) | Return the union of graphs G and H. |
| disjoint_union(G, H) | Return the disjoint union of graphs G and H, forcing distinct integer node labels. |
| intersection(G, H[, create_using]) | Return a new graph that contains only the edges that exist in both G and H. |
| difference(G, H[, create_using]) | Return a new graph that contains the edges that exist in G |
| symmetric_difference(G, H[, create_using]) | Return new graph with edges that exist in either G or H but not both. |