A semiedge is an end of a graph edge in a graph multipole that is not incident with a graph vertex. A dangling edge, which is incident with a vertex at only one end, has one semiedge, while a free edge, which is incident with no vertices, has two semiedges (Máčajová and Škoviera 2021).
Semiedges may be partitioned into sets called connectors. A graph multipole with exactly two connectors is a graph dipole (Máčajová and Škoviera 2021).
