Shared Edges
The graph links lead to pages listing the edges that are in the result of the specified operations.

Operators 

∪ (edge union)  The union of the edges in the operand graphs. 
∩ (edge intersection)  The intersection of the edges in the operand graphs. 
H_{n}(G)  The vertexpairs in graph G that are exactly nhops apart (i.e. a new graph is formed). A nhop exists when the length of the shortest path between two vertices is equal to n. Note that H_{1}(G) = G. 
