Dipole 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.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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 edges is called the dipole graph, and is denoted by . The dipole graph is dual to the cycle graph .

The honeycomb as an abstract graph is the maximal abelian covering graph of the dipole graph , while the diamond crystal as an abstract graph is the maximal abelian covering graph of . 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

Jonathan L. Gross and Jay Yellen, 2006. Graph Theory and Its Applications, 2nd Ed., p. 17. Chapman & Hall/CRC. Sunada T., Topological Crystallography, With a View Towards Discrete Geometric Analysis, Springer, 2013, (Print) 978-4-431-54177-6 (Online)

Text derived from https://en.wikipedia.org/w/index.php?oldid=1258127794 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.