A graph dipole is a graph multipole whose semiedges are partitioned into exactly two sets called connectors. An -dipole has connectors containing and semiedges, respectively (Máčajová and
Škoviera 2021).
Graph dipoles are used as superedges in snark
superpositions (Máčajová and Škoviera 2021).
A graph dipole should not be confused with a dipole graph,
which is a two-vertex multigraph.
-dipole has connectors containing 
and 
semiedges, respectively (Máčajová and
Škoviera 2021).
