Input
Adjacent List
Adjacent Matrix
Traverse
These require its associated graph to be non-empty
Operations
⊖
Complement of A
⊖
Complement of B
These require both Graph A and B to be non-empty
∪
Union
∩
Intersection
×
Cartesian Product
Graph A
Graph B
Subgraph A
Subgraph B
Analysis
{ isomorphism:false traverseA:"" traverseB:"" analysisA:"" analysisB:"" }