Today, Dipole graph is a topic that has captured the attention of millions of people around the world. With its relevance and significance, Dipole graph has generated growing interest in various fields, from politics to entertainment. Whether due to its impact on society or its influence on popular culture, Dipole graph has managed to position itself as an unmissable topic of conversation. In this article, we will thoroughly explore all facets of Dipole graph, analyzing its importance and impact in today's world. Get ready to immerse yourself in the fascinating universe of Dipole graph!
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (November 2024) |
| Dipole graph | |
|---|---|
| Vertices | 2 |
| Edges | n |
| Diameter | 1 (for n ≥ 1) |
| Chromatic number | 2 (for n ≥ 1) |
| Chromatic index | n |
| Properties | connected (for n ≥ 1) planar |
| Table of graphs and parameters | |
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 n edges is called the size-n dipole graph, and is denoted by Dn. The size-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.
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.