Operators¶
Unary operations on graphs
|
Returns the graph complement of G. |
|
Returns the reverse directed graph of G. |
Operations on graphs including union, intersection, difference.
|
Returns a new graph of G composed with H. |
|
Return the union of graphs G and H. |
|
Return the disjoint union of graphs G and H. |
|
Returns a new graph that contains only the edges that exist in both G and H. |
|
Returns a new graph that contains the edges that exist in G but not in H. |
|
Returns new graph with edges that exist in either G or H but not both. |
|
Returns the full join of graphs G and H. |
Operations on many graphs.
|
Returns the composition of all graphs. |
|
Returns the union of all graphs. |
|
Returns the disjoint union of all graphs. |
|
Returns a new graph that contains only the edges that exist in all graphs. |
Graph products.
|
Returns the Cartesian product of G and H. |
|
Returns the lexicographic product of G and H. |
|
Return the rooted product of graphs G and H rooted at root in H. |
|
Returns the strong product of G and H. |
|
Returns the tensor product of G and H. |
|
Returns the specified power of a graph. |