Английская Википедия:Dipole graph
Шаблон:Short description Шаблон:Infobox graph
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 Шаблон:Mvar edges is called the Шаблон:Nowrap dipole graph, and is denoted by Шаблон:Math. The Шаблон:Nowrap dipole graph is dual to the cycle graph Шаблон:Math.
The honeycomb as an abstract graph is the maximal abelian covering graph of the dipole graph Шаблон:Math, while the diamond crystal as an abstract graph is the maximal abelian covering graph of Шаблон:Math.
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.
References
- Шаблон:MathWorld
- Jonathan L. Gross and Jay Yellen, 2006. Graph Theory and Its Applications, 2nd Ed., p. 17. Chapman & Hall/CRC. Шаблон:ISBN
- Sunada T., Topological Crystallography, With a View Towards Discrete Geometric Analysis, Springer, 2013, Шаблон:ISBN (Print) 978-4-431-54177-6 (Online)
