In graph theory, a dipole graph (or dipole) is a multigraph consisting of two vertices connected with a number of parallel edges. A dipole graph containing n edges is called the order-n dipole graph, and is denoted by Dn. The order-n dipole graph is dual to the cycle graph Cn.
- Weisstein, Eric W., "Dipole Graph", MathWorld.
- Jonathan L. Gross and Jay Yellen, 2006. Graph Theory and Its Applications, 2nd Ed., p. 17. Chapman & Hall/CRC. ISBN 1-58488-505-X
|This combinatorics-related article is a stub. You can help Wikipedia by expanding it.|