| Dipole graph | |
| Vertices: | 2 |
| Chromatic Number: | 2 |
| Diameter: | 1 (for) |
| Properties: | connected (for) planar |
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 edges is called the dipole graph, and is denoted by . The dipole graph is dual to the cycle graph .
The honeycomb as an abstract graph is the maximal abelian covering graph of the dipole graph, while the diamond crystal as an abstract graph is the maximal abelian covering graph of .
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.