In graph theory, a dipole graph, dipole, bond graph, or linkage, is a multigraph consisting of two vertices connected with a number of parallel edges.

A dipole graph containing n edges is called the size-n dipole graph, and is denoted by Dn.

Similarly to the Platonic graphs, the dipole graphs form the skeletons of the hosohedra.

Their duals, the cycle graphs, form the skeletons of the dihedra.

This graph theory-related article is a stub.