# Dipole graph

Dipole graph
Vertices 2
Edges ${\displaystyle n}$
Diameter 1 (for ${\displaystyle n\geq 1}$)
Chromatic number 2
Chromatic index ${\displaystyle n}$
Properties connected (for ${\displaystyle n\geq 1}$)
planar

In graph theory, a dipole graph (also called a dipole or bond graph) 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.

The honeycomb as an abstract graph is the maximal abelian covering graph of the dipole graph D3, while the diamond crystal as an abstract graph is the maximal abelian covering graph of D4.

## References

Retrieved from "https://en.wikipedia.org/w/index.php?title=Dipole_graph&oldid=784142921"
This content was retrieved from Wikipedia : http://en.wikipedia.org/wiki/Dipole_graph
This page is based on the copyrighted Wikipedia article "Dipole graph"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA