Dipole graph
From Wikipedia, the free encyclopedia
| Dipole graph | |
|---|---|
 | |
| Vertices | 2 |
| Edges | n |
| Diameter | 1 |
| Chromatic number | 2 |
| Chromatic index | n |
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.
References
- 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 article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.