Английская Википедия: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


Шаблон:Graph-stub