---
tag: SJVXZKVC58
kind: concept
name: Dipole graph
sources:
  - wikipedia: en:6412575@r1258127794
    locator: Dipole graph
    note: adopted
    mention: wikipedia://en/6412575
    sections: [Summary]
same_as:
  wikidata: Q5280042
  wikipedia: Dipole graph
inventory: [KD16AKHEFE]
---

## Summary

In graph theory, a **dipole graph**, **dipole**, **bond graph**, or **linkage**, is a [[multigraph|0C62PZXX02]] 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 $D_{n}$. The size-$n$ dipole graph is dual to the [[cycle graph|0QQ0F12962]] $C_{n}$.