Shared Edges

The graph links lead to pages listing the edges that are in the result of the specified operations.
Graph
Operators
∪ (edge union)The union of the edges in the operand graphs.
∩ (edge intersection)The intersection of the edges in the operand graphs.
Hn(G)The vertex-pairs in graph G that are exactly n-hops apart (i.e. a new graph is formed).
A n-hop exists when the length of the shortest path between two vertices is equal to n.
Note that H1(G) = G.