Dipole graph

From Wikipedia, the free encyclopedia

Dipole graph
Vertices	2
Edges	n
Chromatic number	2
Chromatic index	n
This box: view • talk • edit

In graph theory, a dipole graph (or dipole) is a multigraph consisting of two vertices connected with a number of edges. A dipole graph containing n edges is called the order-n dipole graph, and is denoted by D_n. The order-n dipole graph is dual to the cycle graph C_n.

[edit] References

• Eric W. Weisstein, Dipole Graph at 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